Base | Representation |
---|---|
bin | 1001100001001101… |
… | …0111110101100000 |
3 | 20121002002101022000 |
4 | 2120103113311200 |
5 | 20213113341300 |
6 | 1101315044000 |
7 | 120214653666 |
oct | 23023276540 |
9 | 6532071260 |
10 | 2555215200 |
11 | 10a1396aaa |
12 | 5b38a0600 |
13 | 3194c2575 |
14 | 1a3504c36 |
15 | ee4d5c00 |
hex | 984d7d60 |
2555215200 has 144 divisors (see below), whose sum is σ = 9241439760. Its totient is φ = 681384960.
The previous prime is 2555215193. The next prime is 2555215213. The reversal of 2555215200 is 25125552.
It is a tau number, because it is divible by the number of its divisors (144).
It is a super-2 number, since 2×25552152002 = 13058249436622080000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 37549 + ... + 80748.
It is an arithmetic number, because the mean of its divisors is an integer number (64176665).
Almost surely, 22555215200 is an apocalyptic number.
2555215200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2555215200 is an abundant number, since it is smaller than the sum of its proper divisors (6686224560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2555215200 is a wasteful number, since it uses less digits than its factorization.
2555215200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118326 (or 118307 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 27.
The square root of 2555215200 is about 50549.1364911410. The cubic root of 2555215200 is about 1367.1279452894.
The spelling of 2555215200 in words is "two billion, five hundred fifty-five million, two hundred fifteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •