Base | Representation |
---|---|
bin | 1001000110101110010011… |
… | …0001110100111000101111 |
3 | 1022110001102121112201112212 |
4 | 2101223210301310320233 |
5 | 2303010224142112412 |
6 | 33143012535121035 |
7 | 2052164455350041 |
oct | 221534461647057 |
9 | 38401377481485 |
10 | 10011112066607 |
11 | 320a763855143 |
12 | 115827921317b |
13 | 57807535ca72 |
14 | 26877cc51a91 |
15 | 12562a76c222 |
hex | 91ae4c74e2f |
10011112066607 has 8 divisors (see below), whose sum is σ = 10012909478400. Its totient is φ = 10009314820384.
The previous prime is 10011112066603. The next prime is 10011112066643. The reversal of 10011112066607 is 70666021111001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10011112066607 - 22 = 10011112066603 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011112066603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 193093394 + ... + 193145232.
It is an arithmetic number, because the mean of its divisors is an integer number (1251613684800).
Almost surely, 210011112066607 is an apocalyptic number.
10011112066607 is a deficient number, since it is larger than the sum of its proper divisors (1797411793).
10011112066607 is an equidigital number, since it uses as much as digits as its factorization.
10011112066607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82785.
The product of its (nonzero) digits is 3024, while the sum is 32.
Adding to 10011112066607 its reverse (70666021111001), we get a palindrome (80677133177608).
The spelling of 10011112066607 in words is "ten trillion, eleven billion, one hundred twelve million, sixty-six thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •