Base | Representation |
---|---|
bin | 1010111101111011… |
… | …11011100010000001 |
3 | 120012100210121112001 |
4 | 11132331323202001 |
5 | 44024343311400 |
6 | 2412141504001 |
7 | 265626246301 |
oct | 53675734201 |
9 | 16170717461 |
10 | 5888260225 |
11 | 2551851071 |
12 | 1183b72001 |
13 | 72aba4863 |
14 | 3dc043601 |
15 | 246e14a6a |
hex | 15ef7b881 |
5888260225 has 27 divisors (see below), whose sum is σ = 7422834153. Its totient is φ = 4633566240.
The previous prime is 5888260211. The next prime is 5888260271. The reversal of 5888260225 is 5220628885.
The square root of 5888260225 is 76735.
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 1757370241 + 4130889984 = 41921^2 + 64272^2 .
It is not a de Polignac number, because 5888260225 - 217 = 5888129153 is a prime.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
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 in 26 ways as a sum of consecutive naturals, for example, 39518451 + ... + 39518599.
Almost surely, 25888260225 is an apocalyptic number.
5888260225 is the 76735-th square number.
5888260225 is the 38368-th centered octagonal number.
It is an amenable number.
5888260225 is a deficient number, since it is larger than the sum of its proper divisors (1534573928).
5888260225 is an equidigital number, since it uses as much as digits as its factorization.
5888260225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514 (or 257 counting only the distinct ones).
The product of its (nonzero) digits is 614400, while the sum is 46.
The cubic root of 5888260225 is about 1805.7695758961.
The spelling of 5888260225 in words is "five billion, eight hundred eighty-eight million, two hundred sixty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •