Base | Representation |
---|---|
bin | 1110001010010011000000… |
… | …11000111000000111000101 |
3 | 11002020222010012111021101001 |
4 | 13011021200120320013011 |
5 | 13040144441241430041 |
6 | 150121324522333301 |
7 | 6362541310631635 |
oct | 705114030700705 |
9 | 132228105437331 |
10 | 31140130030021 |
11 | 9a16500642611 |
12 | 35ab1ba65a231 |
13 | 144b66a1c60cc |
14 | 7992943cc6c5 |
15 | 39005d899131 |
hex | 1c52606381c5 |
31140130030021 has 2 divisors, whose sum is σ = 31140130030022. Its totient is φ = 31140130030020.
The previous prime is 31140130029959. The next prime is 31140130030049. The reversal of 31140130030021 is 12003003104113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17760914496900 + 13379215533121 = 4214370^2 + 3657761^2 .
It is a cyclic number.
It is not a de Polignac number, because 31140130030021 - 229 = 31139593159109 is a prime.
It is a super-2 number, since 2×311401300300212 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31140130034021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15570065015010 + 15570065015011.
It is an arithmetic number, because the mean of its divisors is an integer number (15570065015011).
Almost surely, 231140130030021 is an apocalyptic number.
It is an amenable number.
31140130030021 is a deficient number, since it is larger than the sum of its proper divisors (1).
31140130030021 is an equidigital number, since it uses as much as digits as its factorization.
31140130030021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 31140130030021 its reverse (12003003104113), we get a palindrome (43143133134134).
The spelling of 31140130030021 in words is "thirty-one trillion, one hundred forty billion, one hundred thirty million, thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •