Base | Representation |
---|---|
bin | 111011110001001… |
… | …0011110000111001 |
3 | 12011202200001212121 |
4 | 1313202103300321 |
5 | 13101400420203 |
6 | 531000241241 |
7 | 100461214624 |
oct | 16742236071 |
9 | 5152601777 |
10 | 2005482553 |
11 | 93a0517a8 |
12 | 47b770221 |
13 | 25c646989 |
14 | 1504c4dbb |
15 | bb0e70bd |
hex | 77893c39 |
2005482553 has 2 divisors, whose sum is σ = 2005482554. Its totient is φ = 2005482552.
The previous prime is 2005482551. The next prime is 2005482587. The reversal of 2005482553 is 3552845002.
It is an a-pointer prime, because the next prime (2005482587) can be obtained adding 2005482553 to its sum of digits (34).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1319723584 + 685758969 = 36328^2 + 26187^2 .
It is a cyclic number.
It is not a de Polignac number, because 2005482553 - 21 = 2005482551 is a prime.
Together with 2005482551, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2005482551) 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, 1002741276 + 1002741277.
It is an arithmetic number, because the mean of its divisors is an integer number (1002741277).
Almost surely, 22005482553 is an apocalyptic number.
It is an amenable number.
2005482553 is a deficient number, since it is larger than the sum of its proper divisors (1).
2005482553 is an equidigital number, since it uses as much as digits as its factorization.
2005482553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48000, while the sum is 34.
The square root of 2005482553 is about 44782.6144055927. The cubic root of 2005482553 is about 1261.0712635050.
The spelling of 2005482553 in words is "two billion, five million, four hundred eighty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •