Base | Representation |
---|---|
bin | 11001000010001011001001… |
… | …000000111101110010111111 |
3 | 112102211111210121201100212012 |
4 | 121002023021000331302333 |
5 | 103412341423404423244 |
6 | 1030055300110201435 |
7 | 32122334421556004 |
oct | 3102131100756277 |
9 | 472744717640765 |
10 | 110100564139199 |
11 | 32099429160437 |
12 | 104222881b327b |
13 | 4958591931c7a |
14 | 1d28c77c918ab |
15 | cade7d23489e |
hex | 6422c903dcbf |
110100564139199 has 2 divisors, whose sum is σ = 110100564139200. Its totient is φ = 110100564139198.
The previous prime is 110100564139193. The next prime is 110100564139201. The reversal of 110100564139199 is 991931465001011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110100564139199 is a prime.
Together with 110100564139201, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100564139193) 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 as a sum of consecutive naturals, namely, 55050282069599 + 55050282069600.
It is an arithmetic number, because the mean of its divisors is an integer number (55050282069600).
Almost surely, 2110100564139199 is an apocalyptic number.
110100564139199 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100564139199 is an equidigital number, since it uses as much as digits as its factorization.
110100564139199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 262440, while the sum is 50.
The spelling of 110100564139199 in words is "one hundred ten trillion, one hundred billion, five hundred sixty-four million, one hundred thirty-nine thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •