Base | Representation |
---|---|
bin | 100100101111110100… |
… | …100101010010110011 |
3 | 10202211211100020200021 |
4 | 210233310211102303 |
5 | 1121301444102214 |
6 | 30043140504311 |
7 | 2564532061663 |
oct | 445764452263 |
9 | 122754306607 |
10 | 39457019059 |
11 | 15808505467 |
12 | 77920ab097 |
13 | 394a72bb73 |
14 | 1ca44281a3 |
15 | 105decd924 |
hex | 92fd254b3 |
39457019059 has 2 divisors, whose sum is σ = 39457019060. Its totient is φ = 39457019058.
The previous prime is 39457019033. The next prime is 39457019071. The reversal of 39457019059 is 95091075493.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 39457019059 - 211 = 39457017011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 39457018997 and 39457019015.
It is not a weakly prime, because it can be changed into another prime (39457119059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19728509529 + 19728509530.
It is an arithmetic number, because the mean of its divisors is an integer number (19728509530).
Almost surely, 239457019059 is an apocalyptic number.
39457019059 is a deficient number, since it is larger than the sum of its proper divisors (1).
39457019059 is an equidigital number, since it uses as much as digits as its factorization.
39457019059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1530900, while the sum is 52.
The spelling of 39457019059 in words is "thirty-nine billion, four hundred fifty-seven million, nineteen thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •