Base | Representation |
---|---|
bin | 10011110000010101… |
… | …01101111010011011 |
3 | 1000101011002010120121 |
4 | 21320022231322123 |
5 | 133210114310021 |
6 | 4512231334111 |
7 | 523553411662 |
oct | 117012557233 |
9 | 30334063517 |
10 | 10606010011 |
11 | 45528a8333 |
12 | 207bb21337 |
13 | 100040b78c |
14 | 728831dd9 |
15 | 4211b6741 |
hex | 2782ade9b |
10606010011 has 4 divisors (see below), whose sum is σ = 10864693224. Its totient is φ = 10347326800.
The previous prime is 10606009991. The next prime is 10606010039. The reversal of 10606010011 is 11001060601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11001060601 = 3137 ⋅3506873.
It is a cyclic number.
It is not a de Polignac number, because 10606010011 - 217 = 10605878939 is a prime.
It is a super-2 number, since 2×106060100112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10606010911) 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, 129341545 + ... + 129341626.
It is an arithmetic number, because the mean of its divisors is an integer number (2716173306).
Almost surely, 210606010011 is an apocalyptic number.
10606010011 is a deficient number, since it is larger than the sum of its proper divisors (258683213).
10606010011 is an equidigital number, since it uses as much as digits as its factorization.
10606010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258683212.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10606010011 its reverse (11001060601), we get a palindrome (21607070612).
The spelling of 10606010011 in words is "ten billion, six hundred six million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •