Base | Representation |
---|---|
bin | 11101000110100100… |
… | …100001010111011001 |
3 | 2222122210000222101122 |
4 | 131012210201113121 |
5 | 1002444140000131 |
6 | 22204441055025 |
7 | 2154241664345 |
oct | 350644412731 |
9 | 88583028348 |
10 | 31248750041 |
11 | 12286117463 |
12 | 6081187475 |
13 | 2c3ccc7a52 |
14 | 1726228625 |
15 | c2d593d7b |
hex | 7469215d9 |
31248750041 has 2 divisors, whose sum is σ = 31248750042. Its totient is φ = 31248750040.
The previous prime is 31248750023. The next prime is 31248750059. The reversal of 31248750041 is 14005784213.
It is a balanced prime because it is at equal distance from previous prime (31248750023) and next prime (31248750059).
It can be written as a sum of positive squares in only one way, i.e., 27823574416 + 3425175625 = 166804^2 + 58525^2 .
It is a cyclic number.
It is not a de Polignac number, because 31248750041 - 226 = 31181641177 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 31248749983 and 31248750010.
It is not a weakly prime, because it can be changed into another prime (31248750941) 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, 15624375020 + 15624375021.
It is an arithmetic number, because the mean of its divisors is an integer number (15624375021).
Almost surely, 231248750041 is an apocalyptic number.
It is an amenable number.
31248750041 is a deficient number, since it is larger than the sum of its proper divisors (1).
31248750041 is an equidigital number, since it uses as much as digits as its factorization.
31248750041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26880, while the sum is 35.
The spelling of 31248750041 in words is "thirty-one billion, two hundred forty-eight million, seven hundred fifty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •