Base | Representation |
---|---|
bin | 10000010100001000001… |
… | …001100110110001101111 |
3 | 10222011211000002111212121 |
4 | 100110020021212301233 |
5 | 121332030014400421 |
6 | 2215011545013411 |
7 | 143666322652225 |
oct | 20241011466157 |
9 | 3864730074777 |
10 | 1121123200111 |
11 | 3a2513900972 |
12 | 161345a84267 |
13 | 8194c097755 |
14 | 3c396a0ab15 |
15 | 1e26a136d41 |
hex | 10508266c6f |
1121123200111 has 2 divisors, whose sum is σ = 1121123200112. Its totient is φ = 1121123200110.
The previous prime is 1121123200081. The next prime is 1121123200117. The reversal of 1121123200111 is 1110023211211.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (1110023211211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1121123200111 - 227 = 1120988982383 is a prime.
It is a super-3 number, since 3×11211232001113 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121123200117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560561600055 + 560561600056.
It is an arithmetic number, because the mean of its divisors is an integer number (560561600056).
Almost surely, 21121123200111 is an apocalyptic number.
1121123200111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121123200111 is an equidigital number, since it uses as much as digits as its factorization.
1121123200111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 1121123200111 its reverse (1110023211211), we get a palindrome (2231146411322).
The spelling of 1121123200111 in words is "one trillion, one hundred twenty-one billion, one hundred twenty-three million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •