Base | Representation |
---|---|
bin | 10000001001110001111… |
… | …000001100101111011111 |
3 | 10221010010122122011102011 |
4 | 100021301320030233133 |
5 | 121141301100320111 |
6 | 2205533232012051 |
7 | 143124064225603 |
oct | 20116170145737 |
9 | 3833118564364 |
10 | 1110012120031 |
11 | 3988319a3a61 |
12 | 15b164991027 |
13 | 8089b14a259 |
14 | 3ba210a3503 |
15 | 1dd19955021 |
hex | 10271e0cbdf |
1110012120031 has 2 divisors, whose sum is σ = 1110012120032. Its totient is φ = 1110012120030.
The previous prime is 1110012120023. The next prime is 1110012120043. The reversal of 1110012120031 is 1300212100111.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1300212100111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1110012120031 - 23 = 1110012120023 is a prime.
It is a super-2 number, since 2×11100121200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1110012119993 and 1110012120020.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110012120001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555006060015 + 555006060016.
It is an arithmetic number, because the mean of its divisors is an integer number (555006060016).
Almost surely, 21110012120031 is an apocalyptic number.
1110012120031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110012120031 is an equidigital number, since it uses as much as digits as its factorization.
1110012120031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1110012120031 its reverse (1300212100111), we get a palindrome (2410224220142).
The spelling of 1110012120031 in words is "one trillion, one hundred ten billion, twelve million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •