Base | Representation |
---|---|
bin | 1001100001001011… |
… | …0101110011000000 |
3 | 20121001211022001011 |
4 | 2120102311303000 |
5 | 20213044411101 |
6 | 1101312050304 |
7 | 120213533341 |
oct | 23022656300 |
9 | 6531738034 |
10 | 2555075776 |
11 | 10a1301280 |
12 | 5b3833994 |
13 | 319473c76 |
14 | 1a34aa0c8 |
15 | ee4a9751 |
hex | 984b5cc0 |
2555075776 has 56 divisors (see below), whose sum is σ = 5566629456. Its totient is φ = 1153950720.
The previous prime is 2555075759. The next prime is 2555075777. The reversal of 2555075776 is 6775705552.
It is a super-2 number, since 2×25550757762 = 13056824442204004352, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2555075777) 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 in 7 ways as a sum of consecutive naturals, for example, 98970 + ... + 122086.
Almost surely, 22555075776 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2555075776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2783314728).
2555075776 is an abundant number, since it is smaller than the sum of its proper divisors (3011553680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2555075776 is a wasteful number, since it uses less digits than its factorization.
2555075776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23297 (or 23287 counting only the distinct ones).
The product of its (nonzero) digits is 2572500, while the sum is 49.
The square root of 2555075776 is about 50547.7573785425. The cubic root of 2555075776 is about 1367.1030792933.
The spelling of 2555075776 in words is "two billion, five hundred fifty-five million, seventy-five thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •