Base | Representation |
---|---|
bin | 110011001110111000… |
… | …1100111001110010101 |
3 | 101111222120022121102202 |
4 | 1212131301213032111 |
5 | 3300310412223104 |
6 | 122313144214245 |
7 | 10643266602122 |
oct | 1463561471625 |
9 | 344876277382 |
10 | 110021211029 |
11 | 42729118294 |
12 | 193a5a6a385 |
13 | a4b4a15602 |
14 | 5479d45749 |
15 | 2cdddd751e |
hex | 199dc67395 |
110021211029 has 2 divisors, whose sum is σ = 110021211030. Its totient is φ = 110021211028.
The previous prime is 110021210987. The next prime is 110021211037. The reversal of 110021211029 is 920112120011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106000382929 + 4020828100 = 325577^2 + 63410^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110021211029 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 110021211029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110021211059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55010605514 + 55010605515.
It is an arithmetic number, because the mean of its divisors is an integer number (55010605515).
Almost surely, 2110021211029 is an apocalyptic number.
It is an amenable number.
110021211029 is a deficient number, since it is larger than the sum of its proper divisors (1).
110021211029 is an equidigital number, since it uses as much as digits as its factorization.
110021211029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 110021211029 in words is "one hundred ten billion, twenty-one million, two hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •