Base | Representation |
---|---|
bin | 10100101011111000000… |
… | …100000001110010001011 |
3 | 12000220010211221102122112 |
4 | 110223320010001302023 |
5 | 141242213224410011 |
6 | 3005010100012535 |
7 | 204462056151353 |
oct | 24537004016213 |
9 | 5026124842575 |
10 | 1421501013131 |
11 | 4a8945299731 |
12 | 1ab5b599114b |
13 | a407c269c54 |
14 | 4cb2ddb9b63 |
15 | 26e9aa7558b |
hex | 14af8101c8b |
1421501013131 has 2 divisors, whose sum is σ = 1421501013132. Its totient is φ = 1421501013130.
The previous prime is 1421501013083. The next prime is 1421501013139. The reversal of 1421501013131 is 1313101051241.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1421501013131 - 218 = 1421500750987 is a prime.
It is a super-2 number, since 2×14215010131312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1421501013097 and 1421501013106.
It is not a weakly prime, because it can be changed into another prime (1421501013139) 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, 710750506565 + 710750506566.
It is an arithmetic number, because the mean of its divisors is an integer number (710750506566).
Almost surely, 21421501013131 is an apocalyptic number.
1421501013131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1421501013131 is an equidigital number, since it uses as much as digits as its factorization.
1421501013131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 23.
Adding to 1421501013131 its reverse (1313101051241), we get a palindrome (2734602064372).
The spelling of 1421501013131 in words is "one trillion, four hundred twenty-one billion, five hundred one million, thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •