Base | Representation |
---|---|
bin | 10100101011100010010… |
… | …101100010000101011011 |
3 | 12000212012110001101221011 |
4 | 110223202111202011123 |
5 | 141240441421100011 |
6 | 3004505555154351 |
7 | 204450041652112 |
oct | 24534225420533 |
9 | 5025173041834 |
10 | 1421136503131 |
11 | 4a87785639a4 |
12 | 1ab5138a59b7 |
13 | a40218a3467 |
14 | 4cad7812c79 |
15 | 26e78a72621 |
hex | 14ae256215b |
1421136503131 has 2 divisors, whose sum is σ = 1421136503132. Its totient is φ = 1421136503130.
The previous prime is 1421136503119. The next prime is 1421136503153. The reversal of 1421136503131 is 1313056311241.
It is a weak prime.
It is an emirp because it is prime and its reverse (1313056311241) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1421136503131 is a prime.
It is a super-2 number, since 2×14211365031312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1421136503093 and 1421136503102.
It is not a weakly prime, because it can be changed into another prime (1421136503161) 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, 710568251565 + 710568251566.
It is an arithmetic number, because the mean of its divisors is an integer number (710568251566).
Almost surely, 21421136503131 is an apocalyptic number.
1421136503131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1421136503131 is an equidigital number, since it uses as much as digits as its factorization.
1421136503131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 31.
The spelling of 1421136503131 in words is "one trillion, four hundred twenty-one billion, one hundred thirty-six million, five hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •