Base | Representation |
---|---|
bin | 1001111001001111… |
… | …0110011110100000 |
3 | 20212002201222112112 |
4 | 2132103312132200 |
5 | 20414414112000 |
6 | 1115315214452 |
7 | 122550442616 |
oct | 23623663640 |
9 | 6762658475 |
10 | 2656004000 |
11 | 1143277131 |
12 | 6215a7428 |
13 | 334351100 |
14 | 1b2a5d6b6 |
15 | 108294235 |
hex | 9e4f67a0 |
2656004000 has 144 divisors (see below), whose sum is σ = 7068199320. Its totient is φ = 980428800.
The previous prime is 2656003991. The next prime is 2656004083. The reversal of 2656004000 is 4006562.
It can be written as a sum of positive squares in 12 ways, for example, as 1375223056 + 1280780944 = 37084^2 + 35788^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 674036 + ... + 677964.
Almost surely, 22656004000 is an apocalyptic number.
2656004000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2656004000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3534099660).
2656004000 is an abundant number, since it is smaller than the sum of its proper divisors (4412195320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2656004000 is a wasteful number, since it uses less digits than its factorization.
2656004000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3980 (or 3949 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 2656004000 is about 51536.4337144122. The cubic root of 2656004000 is about 1384.8718097415.
The spelling of 2656004000 in words is "two billion, six hundred fifty-six million, four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •