Base | Representation |
---|---|
bin | 10000001010100010101… |
… | …111000110110101011001 |
3 | 10221012020210001020112202 |
4 | 100022202233012311121 |
5 | 121144440421220441 |
6 | 2210150433015545 |
7 | 143153306452022 |
oct | 20124257066531 |
9 | 3835223036482 |
10 | 1110831820121 |
11 | 39911266a851 |
12 | 15b3533b45b5 |
13 | 8099bc09baa |
14 | 3ba9bcb9c49 |
15 | 1dd668be19b |
hex | 102a2bc6d59 |
1110831820121 has 2 divisors, whose sum is σ = 1110831820122. Its totient is φ = 1110831820120.
The previous prime is 1110831820117. The next prime is 1110831820123. The reversal of 1110831820121 is 1210281380111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1067369994496 + 43461825625 = 1033136^2 + 208475^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110831820121 - 22 = 1110831820117 is a prime.
It is a Sophie Germain prime.
Together with 1110831820123, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1110831820123) 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, 555415910060 + 555415910061.
It is an arithmetic number, because the mean of its divisors is an integer number (555415910061).
Almost surely, 21110831820121 is an apocalyptic number.
It is an amenable number.
1110831820121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110831820121 is an equidigital number, since it uses as much as digits as its factorization.
1110831820121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 29.
The spelling of 1110831820121 in words is "one trillion, one hundred ten billion, eight hundred thirty-one million, eight hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •