Base | Representation |
---|---|
bin | 110011010001110101… |
… | …0111000101110101101 |
3 | 101112020110102020201102 |
4 | 1212203222320232231 |
5 | 3301011222023041 |
6 | 122331040052445 |
7 | 10645610333234 |
oct | 1464352705655 |
9 | 345213366642 |
10 | 110120111021 |
11 | 42779a28318 |
12 | 19413004125 |
13 | a4cc36250b |
14 | 548912bb1b |
15 | 2ce792109b |
hex | 19a3ab8bad |
110120111021 has 2 divisors, whose sum is σ = 110120111022. Its totient is φ = 110120111020.
The previous prime is 110120110993. The next prime is 110120111039. The reversal of 110120111021 is 120111021011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106789089796 + 3331021225 = 326786^2 + 57715^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110120111021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110120110993 and 110120111011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110120111051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55060055510 + 55060055511.
It is an arithmetic number, because the mean of its divisors is an integer number (55060055511).
Almost surely, 2110120111021 is an apocalyptic number.
It is an amenable number.
110120111021 is a deficient number, since it is larger than the sum of its proper divisors (1).
110120111021 is an equidigital number, since it uses as much as digits as its factorization.
110120111021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110120111021 its reverse (120111021011), we get a palindrome (230231132032).
The spelling of 110120111021 in words is "one hundred ten billion, one hundred twenty million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •