Base | Representation |
---|---|
bin | 111110111010110… |
… | …100000101101100 |
3 | 2201120022021222012 |
4 | 332322310011230 |
5 | 4130213330400 |
6 | 252425140352 |
7 | 35105331614 |
oct | 7672640554 |
9 | 2646267865 |
10 | 1055605100 |
11 | 4a1952810 |
12 | 25562a6b8 |
13 | 13a908904 |
14 | a02a3a44 |
15 | 62a16d35 |
hex | 3eeb416c |
1055605100 has 72 divisors (see below), whose sum is σ = 2536379328. Its totient is φ = 378100800.
The previous prime is 1055605099. The next prime is 1055605127. The reversal of 1055605100 is 15065501.
It is a super-2 number, since 2×10556051002 = 2228604254292020000, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 66539 + ... + 80861.
Almost surely, 21055605100 is an apocalyptic number.
1055605100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1055605100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1268189664).
1055605100 is an abundant number, since it is smaller than the sum of its proper divisors (1480774228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055605100 is a wasteful number, since it uses less digits than its factorization.
1055605100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14415 (or 14408 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 23.
The square root of 1055605100 is about 32490.0769466617. The cubic root of 1055605100 is about 1018.2017206076.
The spelling of 1055605100 in words is "one billion, fifty-five million, six hundred five thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •