Base | Representation |
---|---|
bin | 1010100001110001… |
… | …0001111000010001 |
3 | 21021221120221101121 |
4 | 2220130101320101 |
5 | 21241423014203 |
6 | 1144230402241 |
7 | 130013323636 |
oct | 25034217021 |
9 | 7257527347 |
10 | 2825985553 |
11 | 1220216856 |
12 | 66a500381 |
13 | 360627c01 |
14 | 1cb46a18d |
15 | 11816e0bd |
hex | a8711e11 |
2825985553 has 2 divisors, whose sum is σ = 2825985554. Its totient is φ = 2825985552.
The previous prime is 2825985527. The next prime is 2825985607. The reversal of 2825985553 is 3555895282.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2609983744 + 216001809 = 51088^2 + 14697^2 .
It is a cyclic number.
It is not a de Polignac number, because 2825985553 - 213 = 2825977361 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2825985553.
It is not a weakly prime, because it can be changed into another prime (2825985853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1412992776 + 1412992777.
It is an arithmetic number, because the mean of its divisors is an integer number (1412992777).
Almost surely, 22825985553 is an apocalyptic number.
It is an amenable number.
2825985553 is a deficient number, since it is larger than the sum of its proper divisors (1).
2825985553 is an equidigital number, since it uses as much as digits as its factorization.
2825985553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4320000, while the sum is 52.
The square root of 2825985553 is about 53159.9995579383. Note that the first 3 decimals coincide. The cubic root of 2825985553 is about 1413.8065166021.
The spelling of 2825985553 in words is "two billion, eight hundred twenty-five million, nine hundred eighty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •