Base | Representation |
---|---|
bin | 10010101110110101… |
… | …01100110011101100 |
3 | 221221212011202102022 |
4 | 21113122230303230 |
5 | 131043434123120 |
6 | 4341522445312 |
7 | 504132164411 |
oct | 112732546354 |
9 | 27855152368 |
10 | 10056551660 |
11 | 42a0730121 |
12 | 1b47b03838 |
13 | c4362a9ac |
14 | 6b5884108 |
15 | 3dcd2e025 |
hex | 2576accec |
10056551660 has 12 divisors (see below), whose sum is σ = 21118758528. Its totient is φ = 4022620656.
The previous prime is 10056551651. The next prime is 10056551663. The reversal of 10056551660 is 6615565001.
It is a super-2 number, since 2×100565516602 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10056551660.
It is not an unprimeable number, because it can be changed into a prime (10056551663) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 251413772 + ... + 251413811.
It is an arithmetic number, because the mean of its divisors is an integer number (1759896544).
Almost surely, 210056551660 is an apocalyptic number.
10056551660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10056551660 is an abundant number, since it is smaller than the sum of its proper divisors (11062206868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10056551660 is a wasteful number, since it uses less digits than its factorization.
10056551660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502827592 (or 502827590 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 10056551660 in words is "ten billion, fifty-six million, five hundred fifty-one thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •