Base | Representation |
---|---|
bin | 1001001001100110010100… |
… | …1000001110000000111001 |
3 | 1022121202221020120211011222 |
4 | 2102121211020032000321 |
5 | 2304312411033414401 |
6 | 33221422353401425 |
7 | 2055563550360200 |
oct | 222314510160071 |
9 | 38552836524158 |
10 | 10060510060601 |
11 | 322970271a170 |
12 | 1165964569275 |
13 | 57c918480b00 |
14 | 26ad07636237 |
15 | 126a6c349c1b |
hex | 9266520e039 |
10060510060601 has 288 divisors, whose sum is σ = 14478394896000. Its totient is φ = 6904235520000.
The previous prime is 10060510060597. The next prime is 10060510060607. The reversal of 10060510060601 is 10606001506001.
It is not a de Polignac number, because 10060510060601 - 22 = 10060510060597 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10060510060607) by changing a digit.
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 287 ways as a sum of consecutive naturals, for example, 56203966730 + ... + 56203966908.
It is an arithmetic number, because the mean of its divisors is an integer number (50272204500).
Almost surely, 210060510060601 is an apocalyptic number.
10060510060601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10060510060601 is a deficient number, since it is larger than the sum of its proper divisors (4417884835399).
10060510060601 is a wasteful number, since it uses less digits than its factorization.
10060510060601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521 (or 501 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 10060510060601 its reverse (10606001506001), we get a palindrome (20666511566602).
The spelling of 10060510060601 in words is "ten trillion, sixty billion, five hundred ten million, sixty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •