Base | Representation |
---|---|
bin | 10001101010110000000… |
… | …011010010110110011011 |
3 | 11022001220010010121101202 |
4 | 101222300003102312123 |
5 | 124343021403244011 |
6 | 2325433214304415 |
7 | 153501245246036 |
oct | 21526003226633 |
9 | 4261803117352 |
10 | 1214134431131 |
11 | 428a03263436 |
12 | 1773831b810b |
13 | 8a652a0421b |
14 | 42a9b7d601d |
15 | 218b0a2523b |
hex | 11ab00d2d9b |
1214134431131 has 2 divisors, whose sum is σ = 1214134431132. Its totient is φ = 1214134431130.
The previous prime is 1214134431007. The next prime is 1214134431199. The reversal of 1214134431131 is 1311344314121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1214134431131 - 218 = 1214134168987 is a prime.
It is a super-2 number, since 2×12141344311312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1214134431094 and 1214134431103.
It is not a weakly prime, because it can be changed into another prime (1214134431331) 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, 607067215565 + 607067215566.
It is an arithmetic number, because the mean of its divisors is an integer number (607067215566).
Almost surely, 21214134431131 is an apocalyptic number.
1214134431131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1214134431131 is an equidigital number, since it uses as much as digits as its factorization.
1214134431131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 29.
Adding to 1214134431131 its reverse (1311344314121), we get a palindrome (2525478745252).
The spelling of 1214134431131 in words is "one trillion, two hundred fourteen billion, one hundred thirty-four million, four hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •