Base | Representation |
---|---|
bin | 101011001101100101001… |
… | …1111101100101100010001 |
3 | 210000202201001111220101221 |
4 | 1112123022133230230101 |
5 | 1234301124240011400 |
6 | 20344205215525041 |
7 | 1152040000000000 |
oct | 126331237545421 |
9 | 23022631456357 |
10 | 5939042110225 |
11 | 198a808493654 |
12 | 7bb039229781 |
13 | 34108431a933 |
14 | 167646030c37 |
15 | a474c5c0c1a |
hex | 566ca7ecb11 |
5939042110225 has 99 divisors (see below), whose sum is σ = 8898299893457. Its totient is φ = 3932055466080.
The previous prime is 5939042110217. The next prime is 5939042110237. The reversal of 5939042110225 is 5220112409395.
The square root of 5939042110225 is 2437015.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 81635346961 + 5857406763264 = 285719^2 + 2420208^2 .
It is not a de Polignac number, because 5939042110225 - 23 = 5939042110217 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 98 ways as a sum of consecutive naturals, for example, 204794555511 + ... + 204794555539.
Almost surely, 25939042110225 is an apocalyptic number.
5939042110225 is the 2437015-th square number.
5939042110225 is the 1218508-th centered octagonal number.
It is an amenable number.
5939042110225 is a deficient number, since it is larger than the sum of its proper divisors (2959257783232).
5939042110225 is an frugal number, since it uses more digits than its factorization.
5939042110225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138 (or 41 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 43.
The spelling of 5939042110225 in words is "five trillion, nine hundred thirty-nine billion, forty-two million, one hundred ten thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •