Base | Representation |
---|---|
bin | 10001101011001001000… |
… | …001010100000001011111 |
3 | 11022002222022101111010212 |
4 | 101223021001110001133 |
5 | 124344401123421142 |
6 | 2325542541123035 |
7 | 153514523032463 |
oct | 21531101240137 |
9 | 4262868344125 |
10 | 1214553342047 |
11 | 4290a8775401 |
12 | 17747b55947b |
13 | 8a6bb7372c6 |
14 | 42adb2c04a3 |
15 | 218d76c1d82 |
hex | 11ac905405f |
1214553342047 has 2 divisors, whose sum is σ = 1214553342048. Its totient is φ = 1214553342046.
The previous prime is 1214553342019. The next prime is 1214553342049. The reversal of 1214553342047 is 7402433554121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1214553342047 - 212 = 1214553337951 is a prime.
Together with 1214553342049, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1214553341995 and 1214553342013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1214553342049) 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, 607276671023 + 607276671024.
It is an arithmetic number, because the mean of its divisors is an integer number (607276671024).
Almost surely, 21214553342047 is an apocalyptic number.
1214553342047 is a deficient number, since it is larger than the sum of its proper divisors (1).
1214553342047 is an equidigital number, since it uses as much as digits as its factorization.
1214553342047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 403200, while the sum is 41.
Adding to 1214553342047 its reverse (7402433554121), we get a palindrome (8616986896168).
The spelling of 1214553342047 in words is "one trillion, two hundred fourteen billion, five hundred fifty-three million, three hundred forty-two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •