Base | Representation |
---|---|
bin | 1001100001011110… |
… | …0100000000000000 |
3 | 20121011011012000111 |
4 | 2120113210000000 |
5 | 20213404013400 |
6 | 1101354401104 |
7 | 120230210221 |
oct | 23027440000 |
9 | 6534135014 |
10 | 2556313600 |
11 | 10a1a77275 |
12 | 5b4130194 |
13 | 3197b84c9 |
14 | 1a370d248 |
15 | ee6513ba |
hex | 985e4000 |
2556313600 has 135 divisors (see below), whose sum is σ = 6420726417. Its totient is φ = 1009582080.
The previous prime is 2556313577. The next prime is 2556313601. The reversal of 2556313600 is 63136552.
The square root of 2556313600 is 50560.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 920272896 + 1636040704 = 30336^2 + 40448^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2556313601) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 32358361 + ... + 32358439.
Almost surely, 22556313600 is an apocalyptic number.
2556313600 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
2556313600 is the 50560-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2556313600
2556313600 is an abundant number, since it is smaller than the sum of its proper divisors (3864412817).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2556313600 is an frugal number, since it uses more digits than its factorization.
2556313600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196 (or 86 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 31.
The cubic root of 2556313600 is about 1367.3238111427.
The spelling of 2556313600 in words is "two billion, five hundred fifty-six million, three hundred thirteen thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •