Base | Representation |
---|---|
bin | 1001001110001110110100… |
… | …0111100100111011100111 |
3 | 1022220101101001222201102122 |
4 | 2103203231013210323213 |
5 | 2312113411324130111 |
6 | 33322144215500155 |
7 | 2064412104263024 |
oct | 223435507447347 |
9 | 38811331881378 |
10 | 10140101005031 |
11 | 325a435735798 |
12 | 117927738765b |
13 | 5872909235ba |
14 | 270ad7d3054b |
15 | 128b79966cdb |
hex | 938ed1e4ee7 |
10140101005031 has 2 divisors, whose sum is σ = 10140101005032. Its totient is φ = 10140101005030.
The previous prime is 10140101005007. The next prime is 10140101005033. The reversal of 10140101005031 is 13050010104101.
It is a strong prime.
It is an emirp because it is prime and its reverse (13050010104101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10140101005031 is a prime.
It is a super-2 number, since 2×101401010050312 (a number of 27 digits) contains 22 as substring.
Together with 10140101005033, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10140101005033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070050502515 + 5070050502516.
It is an arithmetic number, because the mean of its divisors is an integer number (5070050502516).
Almost surely, 210140101005031 is an apocalyptic number.
10140101005031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140101005031 is an equidigital number, since it uses as much as digits as its factorization.
10140101005031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 10140101005031 its reverse (13050010104101), we get a palindrome (23190111109132).
The spelling of 10140101005031 in words is "ten trillion, one hundred forty billion, one hundred one million, five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •