Base | Representation |
---|---|
bin | 100101001100100001110… |
… | …100011000000101101000 |
3 | 100001100200010011000010012 |
4 | 211030201310120011220 |
5 | 313334314131410100 |
6 | 5234124345311052 |
7 | 352445604221510 |
oct | 45144164300550 |
9 | 10040603130105 |
10 | 2556072919400 |
11 | 8a602a587590 |
12 | 353473795488 |
13 | 15706266c1a0 |
14 | 8ba00b94840 |
15 | 467516e4135 |
hex | 25321d18168 |
2556072919400 has 384 divisors, whose sum is σ = 8149038428160. Its totient is φ = 719763840000.
The previous prime is 2556072919357. The next prime is 2556072919501. The reversal of 2556072919400 is 49192706552.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 9273575 + ... + 9545225.
It is an arithmetic number, because the mean of its divisors is an integer number (21221454240).
Almost surely, 22556072919400 is an apocalyptic number.
2556072919400 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 2556072919400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4074519214080).
2556072919400 is an abundant number, since it is smaller than the sum of its proper divisors (5592965508760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2556072919400 is a wasteful number, since it uses less digits than its factorization.
2556072919400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271745 (or 271736 counting only the distinct ones).
The product of its (nonzero) digits is 1360800, while the sum is 50.
The spelling of 2556072919400 in words is "two trillion, five hundred fifty-six billion, seventy-two million, nine hundred nineteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •