Base | Representation |
---|---|
bin | 1000010001011010… |
… | …1100001010000111 |
3 | 12201202100010222122 |
4 | 2010112230022013 |
5 | 14021424244201 |
6 | 1004201520155 |
7 | 106012166105 |
oct | 20426541207 |
9 | 5652303878 |
10 | 2220540551 |
11 | a3a489a89 |
12 | 51b7a305b |
13 | 295073b28 |
14 | 170ca6c75 |
15 | cee27e1b |
hex | 845ac287 |
2220540551 has 2 divisors, whose sum is σ = 2220540552. Its totient is φ = 2220540550.
The previous prime is 2220540547. The next prime is 2220540577. The reversal of 2220540551 is 1550450222.
It is an a-pointer prime, because the next prime (2220540577) can be obtained adding 2220540551 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2220540551 - 22 = 2220540547 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2220540551.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2220540541) 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, 1110270275 + 1110270276.
It is an arithmetic number, because the mean of its divisors is an integer number (1110270276).
Almost surely, 22220540551 is an apocalyptic number.
2220540551 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220540551 is an equidigital number, since it uses as much as digits as its factorization.
2220540551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4000, while the sum is 26.
The square root of 2220540551 is about 47122.6118864394. The cubic root of 2220540551 is about 1304.6266213073.
Adding to 2220540551 its reverse (1550450222), we get a palindrome (3770990773).
The spelling of 2220540551 in words is "two billion, two hundred twenty million, five hundred forty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •