Base | Representation |
---|---|
bin | 110011010001100100… |
… | …0111001011100011011 |
3 | 101112012211122120112112 |
4 | 1212203020321130123 |
5 | 3301001431413201 |
6 | 122330121102535 |
7 | 10645441523525 |
oct | 1464310713433 |
9 | 345184576475 |
10 | 110111201051 |
11 | 427749a2105 |
12 | 19410027a4b |
13 | a4ca562b47 |
14 | 5487c8ca15 |
15 | 2ce6c610bb |
hex | 19a323971b |
110111201051 has 2 divisors, whose sum is σ = 110111201052. Its totient is φ = 110111201050.
The previous prime is 110111201023. The next prime is 110111201089. The reversal of 110111201051 is 150102111011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110111201051 - 210 = 110111200027 is a prime.
It is not a weakly prime, because it can be changed into another prime (110111201951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055600525 + 55055600526.
It is an arithmetic number, because the mean of its divisors is an integer number (55055600526).
Almost surely, 2110111201051 is an apocalyptic number.
110111201051 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111201051 is an equidigital number, since it uses as much as digits as its factorization.
110111201051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 14.
Adding to 110111201051 its reverse (150102111011), we get a palindrome (260213312062).
The spelling of 110111201051 in words is "one hundred ten billion, one hundred eleven million, two hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •