Base | Representation |
---|---|
bin | 11001000010001010101101… |
… | …010110011101000000101011 |
3 | 112102211110121021101011022212 |
4 | 121002022231112131000223 |
5 | 103412340001100310102 |
6 | 1030055142050235335 |
7 | 32122320054541511 |
oct | 3102125526350053 |
9 | 472743537334285 |
10 | 110100100010027 |
11 | 32099210174306 |
12 | 10422178885b4b |
13 | 495851972911a |
14 | 1d28c323964b1 |
15 | cade52604c52 |
hex | 6422ad59d02b |
110100100010027 has 2 divisors, whose sum is σ = 110100100010028. Its totient is φ = 110100100010026.
The previous prime is 110100100009993. The next prime is 110100100010063. The reversal of 110100100010027 is 720010001001011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110100100010027 - 214 = 110100099993643 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100100009993 and 110100100010020.
It is not a weakly prime, because it can be changed into another prime (110100100030027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050050005013 + 55050050005014.
It is an arithmetic number, because the mean of its divisors is an integer number (55050050005014).
Almost surely, 2110100100010027 is an apocalyptic number.
110100100010027 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100100010027 is an equidigital number, since it uses as much as digits as its factorization.
110100100010027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 14.
Adding to 110100100010027 its reverse (720010001001011), we get a palindrome (830110101011038).
The spelling of 110100100010027 in words is "one hundred ten trillion, one hundred billion, one hundred million, ten thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •