Base | Representation |
---|---|
bin | 11001000010011101010000… |
… | …101111000010101001010011 |
3 | 112102220101000121020212022201 |
4 | 121002131100233002221103 |
5 | 103413201300334323102 |
6 | 1030112234514344031 |
7 | 32123623530341566 |
oct | 3102352057025123 |
9 | 472811017225281 |
10 | 110120021011027 |
11 | 320a67030461a5 |
12 | 10425bb828b017 |
13 | 495a372934191 |
14 | 1d29ba1d964dd |
15 | cae71b468987 |
hex | 642750bc2a53 |
110120021011027 has 2 divisors, whose sum is σ = 110120021011028. Its totient is φ = 110120021011026.
The previous prime is 110120021010949. The next prime is 110120021011031. The reversal of 110120021011027 is 720110120021011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110120021011027 - 211 = 110120021008979 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110120021010995 and 110120021011013.
It is not a weakly prime, because it can be changed into another prime (110120021011327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55060010505513 + 55060010505514.
It is an arithmetic number, because the mean of its divisors is an integer number (55060010505514).
Almost surely, 2110120021011027 is an apocalyptic number.
110120021011027 is a deficient number, since it is larger than the sum of its proper divisors (1).
110120021011027 is an equidigital number, since it uses as much as digits as its factorization.
110120021011027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 110120021011027 its reverse (720110120021011), we get a palindrome (830230141032038).
The spelling of 110120021011027 in words is "one hundred ten trillion, one hundred twenty billion, twenty-one million, eleven thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •