Base | Representation |
---|---|
bin | 100110111000100000001… |
… | …011110000011111000000 |
3 | 100110102220221111011122100 |
4 | 212320200023300133000 |
5 | 322234233430024300 |
6 | 5403300531110400 |
7 | 364021613644356 |
oct | 46704013603700 |
9 | 10412827434570 |
10 | 2672009611200 |
11 | 940213848056 |
12 | 371a2a742400 |
13 | 164c7aa9a177 |
14 | 9347c5c77d6 |
15 | 49789abb700 |
hex | 26e202f07c0 |
2672009611200 has 1008 divisors, whose sum is σ = 10273279610880. Its totient is φ = 656505077760.
The previous prime is 2672009611129. The next prime is 2672009611267. The reversal of 2672009611200 is 21169002762.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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 143 ways as a sum of consecutive naturals, for example, 4505918104 + ... + 4505918696.
Almost surely, 22672009611200 is an apocalyptic number.
2672009611200 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 2672009611200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5136639805440).
2672009611200 is an abundant number, since it is smaller than the sum of its proper divisors (7601269999680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2672009611200 is a wasteful number, since it uses less digits than its factorization.
2672009611200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1066 (or 1048 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The spelling of 2672009611200 in words is "two trillion, six hundred seventy-two billion, nine million, six hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •