Base | Representation |
---|---|
bin | 10000001101100000111… |
… | …010001111111101100011 |
3 | 10221111111010201002222012 |
4 | 100031200322033331203 |
5 | 121223004214142011 |
6 | 2211435210303135 |
7 | 143325341156366 |
oct | 20154072177543 |
9 | 3844433632865 |
10 | 1114022412131 |
11 | 39a4aa677852 |
12 | 15baa3a27aab |
13 | 81089c33465 |
14 | 3bcc19360dd |
15 | 1dea1a5ea8b |
hex | 10360e8ff63 |
1114022412131 has 2 divisors, whose sum is σ = 1114022412132. Its totient is φ = 1114022412130.
The previous prime is 1114022412109. The next prime is 1114022412137. The reversal of 1114022412131 is 1312142204111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1114022412131 - 222 = 1114018217827 is a prime.
It is a super-2 number, since 2×11140224121312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1114022412097 and 1114022412106.
It is not a weakly prime, because it can be changed into another prime (1114022412137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557011206065 + 557011206066.
It is an arithmetic number, because the mean of its divisors is an integer number (557011206066).
Almost surely, 21114022412131 is an apocalyptic number.
1114022412131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114022412131 is an equidigital number, since it uses as much as digits as its factorization.
1114022412131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 1114022412131 its reverse (1312142204111), we get a palindrome (2426164616242).
The spelling of 1114022412131 in words is "one trillion, one hundred fourteen billion, twenty-two million, four hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •