Base | Representation |
---|---|
bin | 1001100001011111… |
… | …1110100110010111 |
3 | 20121011100201110201 |
4 | 2120113332212113 |
5 | 20213421010201 |
6 | 1101401001331 |
7 | 120231142654 |
oct | 23027764627 |
9 | 6534321421 |
10 | 2556422551 |
11 | 10a2041111 |
12 | 5b4183247 |
13 | 319825c87 |
14 | 1a373ac2b |
15 | ee673801 |
hex | 985fe997 |
2556422551 has 12 divisors (see below), whose sum is σ = 2599621032. Its totient is φ = 2513923776.
The previous prime is 2556422503. The next prime is 2556422563. The reversal of 2556422551 is 1552246552.
It is not a de Polignac number, because 2556422551 - 219 = 2555898263 is a prime.
It is a super-2 number, since 2×25564225512 = 13070592518522695202, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2556422551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2556422581) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 2914525 + ... + 2915401.
It is an arithmetic number, because the mean of its divisors is an integer number (216635086).
Almost surely, 22556422551 is an apocalyptic number.
2556422551 is a deficient number, since it is larger than the sum of its proper divisors (43198481).
2556422551 is an frugal number, since it uses more digits than its factorization.
2556422551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1570 (or 1497 counting only the distinct ones).
The product of its digits is 120000, while the sum is 37.
The square root of 2556422551 is about 50561.0774311624. The cubic root of 2556422551 is about 1367.3432361434.
The spelling of 2556422551 in words is "two billion, five hundred fifty-six million, four hundred twenty-two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •