Base | Representation |
---|---|
bin | 111111000000100… |
… | …001110000110100 |
3 | 2201200010101120021 |
4 | 333000201300310 |
5 | 4131104243100 |
6 | 252521214524 |
7 | 35124140440 |
oct | 7700416064 |
9 | 2650111507 |
10 | 1057102900 |
11 | 4a2786067 |
12 | 256031444 |
13 | 13b011599 |
14 | a0573820 |
15 | 62c10a1a |
hex | 3f021c34 |
1057102900 has 36 divisors (see below), whose sum is σ = 2621616928. Its totient is φ = 362435040.
The previous prime is 1057102873. The next prime is 1057102903. The reversal of 1057102900 is 92017501.
It is a super-2 number, since 2×10571029002 = 2234933082376820000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1057102903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 754374 + ... + 755773.
Almost surely, 21057102900 is an apocalyptic number.
1057102900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1057102900 is an abundant number, since it is smaller than the sum of its proper divisors (1564514028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1057102900 is a wasteful number, since it uses less digits than its factorization.
1057102900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1510168 (or 1510161 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 25.
The square root of 1057102900 is about 32513.1188906878. The cubic root of 1057102900 is about 1018.6830691095.
The spelling of 1057102900 in words is "one billion, fifty-seven million, one hundred two thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.246 sec. • engine limits •