Base | Representation |
---|---|
bin | 1001001110001110110100… |
… | …0111100100111011101001 |
3 | 1022220101101001222201102201 |
4 | 2103203231013210323221 |
5 | 2312113411324130113 |
6 | 33322144215500201 |
7 | 2064412104263026 |
oct | 223435507447351 |
9 | 38811331881381 |
10 | 10140101005033 |
11 | 325a43573579a |
12 | 1179277387661 |
13 | 5872909235bc |
14 | 270ad7d3054d |
15 | 128b79966cdd |
hex | 938ed1e4ee9 |
10140101005033 has 2 divisors, whose sum is σ = 10140101005034. Its totient is φ = 10140101005032.
The previous prime is 10140101005031. The next prime is 10140101005057. The reversal of 10140101005033 is 33050010104101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10140065816409 + 35188624 = 3184347^2 + 5932^2 .
It is a cyclic number.
It is not a de Polignac number, because 10140101005033 - 21 = 10140101005031 is a prime.
Together with 10140101005031, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10140101005033.
It is not a weakly prime, because it can be changed into another prime (10140101005031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070050502516 + 5070050502517.
It is an arithmetic number, because the mean of its divisors is an integer number (5070050502517).
Almost surely, 210140101005033 is an apocalyptic number.
It is an amenable number.
10140101005033 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140101005033 is an equidigital number, since it uses as much as digits as its factorization.
10140101005033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 180, while the sum is 19.
Adding to 10140101005033 its reverse (33050010104101), we get a palindrome (43190111109134).
The spelling of 10140101005033 in words is "ten trillion, one hundred forty billion, one hundred one million, five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •