Base | Representation |
---|---|
bin | 1001100110001011110010… |
… | …1110111100000000100101 |
3 | 1101100201112120102110201010 |
4 | 2121202330232330000211 |
5 | 2340334142130200010 |
6 | 34235201350052433 |
7 | 2136220431004005 |
oct | 231427456740045 |
9 | 41321476373633 |
10 | 10551606100005 |
11 | 33a8a02622243 |
12 | 1224b7b64a119 |
13 | 5b7020a06439 |
14 | 2869b40c4005 |
15 | 134711422620 |
hex | 998bcbbc025 |
10551606100005 has 32 divisors (see below), whose sum is σ = 17876261983104. Its totient is φ = 5296314730496.
The previous prime is 10551606099989. The next prime is 10551606100019. The reversal of 10551606100005 is 50000160615501.
It is a cyclic number.
It is not a de Polignac number, because 10551606100005 - 24 = 10551606099989 is a prime.
It is a super-3 number, since 3×105516061000053 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7090009 + ... + 8448161.
It is an arithmetic number, because the mean of its divisors is an integer number (558633186972).
Almost surely, 210551606100005 is an apocalyptic number.
10551606100005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10551606100005 is a deficient number, since it is larger than the sum of its proper divisors (7324655883099).
10551606100005 is a wasteful number, since it uses less digits than its factorization.
10551606100005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1388645.
The product of its (nonzero) digits is 4500, while the sum is 30.
Adding to 10551606100005 its reverse (50000160615501), we get a palindrome (60551766715506).
The spelling of 10551606100005 in words is "ten trillion, five hundred fifty-one billion, six hundred six million, one hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •