Base | Representation |
---|---|
bin | 11101011100010110… |
… | …000000101101110001 |
3 | 10000121020101212221002 |
4 | 131130112000231301 |
5 | 1004221143420131 |
6 | 22305010411345 |
7 | 2166265643345 |
oct | 353426005561 |
9 | 100536355832 |
10 | 31614045041 |
11 | 12453338a57 |
12 | 6163590b55 |
13 | 2c9a8a7937 |
14 | 175c957625 |
15 | c5069e6cb |
hex | 75c580b71 |
31614045041 has 2 divisors, whose sum is σ = 31614045042. Its totient is φ = 31614045040.
The previous prime is 31614045037. The next prime is 31614045049. The reversal of 31614045041 is 14054041613.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23242527025 + 8371518016 = 152455^2 + 91496^2 .
It is an emirp because it is prime and its reverse (14054041613) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31614045041 - 22 = 31614045037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31614044995 and 31614045013.
It is not a weakly prime, because it can be changed into another prime (31614045049) 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, 15807022520 + 15807022521.
It is an arithmetic number, because the mean of its divisors is an integer number (15807022521).
Almost surely, 231614045041 is an apocalyptic number.
It is an amenable number.
31614045041 is a deficient number, since it is larger than the sum of its proper divisors (1).
31614045041 is an equidigital number, since it uses as much as digits as its factorization.
31614045041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 31614045041 its reverse (14054041613), we get a palindrome (45668086654).
The spelling of 31614045041 in words is "thirty-one billion, six hundred fourteen million, forty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •