Base | Representation |
---|---|
bin | 1001100100001001100110… |
… | …1000101001111100010010 |
3 | 1101020101022221111021001120 |
4 | 2121002121220221330102 |
5 | 2334301103310342320 |
6 | 34211141420343110 |
7 | 2133542401626333 |
oct | 231023150517422 |
9 | 41211287437046 |
10 | 10516657512210 |
11 | 33950a8aa6a33 |
12 | 121a2473a4a96 |
13 | 5b39413438a5 |
14 | 28501a75c28a |
15 | 13386814a440 |
hex | 99099a29f12 |
10516657512210 has 64 divisors (see below), whose sum is σ = 26440832678400. Its totient is φ = 2673461935872.
The previous prime is 10516657512197. The next prime is 10516657512217. The reversal of 10516657512210 is 1221575661501.
It is a happy number.
It is a super-2 number, since 2×105166575122102 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10516657512217) 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 31 ways as a sum of consecutive naturals, for example, 76438309 + ... + 76575768.
It is an arithmetic number, because the mean of its divisors is an integer number (413138010600).
Almost surely, 210516657512210 is an apocalyptic number.
10516657512210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10516657512210 is an abundant number, since it is smaller than the sum of its proper divisors (15924175166190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10516657512210 is a wasteful number, since it uses less digits than its factorization.
10516657512210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153014195.
The product of its (nonzero) digits is 126000, while the sum is 42.
The spelling of 10516657512210 in words is "ten trillion, five hundred sixteen billion, six hundred fifty-seven million, five hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •