Base | Representation |
---|---|
bin | 111110111010100… |
… | …111110111000010 |
3 | 2201120012202021000 |
4 | 332322213313002 |
5 | 4130210230020 |
6 | 252424112430 |
7 | 35105032566 |
oct | 7672476702 |
9 | 2646182230 |
10 | 1055555010 |
11 | 4a1919114 |
12 | 255605716 |
13 | 13a8bbb83 |
14 | a028d6a6 |
15 | 62a07090 |
hex | 3eea7dc2 |
1055555010 has 32 divisors (see below), whose sum is σ = 2814814080. Its totient is φ = 281481264.
The previous prime is 1055555009. The next prime is 1055555047. The reversal of 1055555010 is 105555501.
1055555010 is a `hidden beast` number, since 105 + 5 + 5 + 550 + 1 + 0 = 666.
It is a super-2 number, since 2×10555550102 = 2228392758272200200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1954462 + ... + 1955001.
It is an arithmetic number, because the mean of its divisors is an integer number (87962940).
Almost surely, 21055555010 is an apocalyptic number.
1055555010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1055555010 is an abundant number, since it is smaller than the sum of its proper divisors (1759259070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055555010 is a wasteful number, since it uses less digits than its factorization.
1055555010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3909479 (or 3909473 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 27.
The square root of 1055555010 is about 32489.3060867726. The cubic root of 1055555010 is about 1018.1856153011.
The spelling of 1055555010 in words is "one billion, fifty-five million, five hundred fifty-five thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •