Base | Representation |
---|---|
bin | 11001000011100111110101… |
… | …111100100111100011001011 |
3 | 112110012000201121011212212111 |
4 | 121003213311330213203023 |
5 | 103421004302132101102 |
6 | 1030213121132523151 |
7 | 32132460156402136 |
oct | 3103476574474313 |
9 | 473160647155774 |
10 | 110200102222027 |
11 | 32127667880304 |
12 | 104396273204b7 |
13 | 4964a9583162c |
14 | 1d2d9db83121d |
15 | cb1856b29cd7 |
hex | 6439f5f278cb |
110200102222027 has 2 divisors, whose sum is σ = 110200102222028. Its totient is φ = 110200102222026.
The previous prime is 110200102221977. The next prime is 110200102222031. The reversal of 110200102222027 is 720222201002011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110200102222027 - 27 = 110200102221899 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110200102221989 and 110200102222007.
It is not a weakly prime, because it can be changed into another prime (110200102222627) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55100051111013 + 55100051111014.
It is an arithmetic number, because the mean of its divisors is an integer number (55100051111014).
Almost surely, 2110200102222027 is an apocalyptic number.
110200102222027 is a deficient number, since it is larger than the sum of its proper divisors (1).
110200102222027 is an equidigital number, since it uses as much as digits as its factorization.
110200102222027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 22.
Adding to 110200102222027 its reverse (720222201002011), we get a palindrome (830422303224038).
The spelling of 110200102222027 in words is "one hundred ten trillion, two hundred billion, one hundred two million, two hundred twenty-two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •