Base | Representation |
---|---|
bin | 11111110110101100011… |
… | …000011110101000001000 |
3 | 21202021021021222202010120 |
4 | 133312230120132220020 |
5 | 241331113243423340 |
6 | 4353343211343240 |
7 | 314103133555530 |
oct | 37665430365010 |
9 | 7667237882116 |
10 | 2189030451720 |
11 | 7743a9693002 |
12 | 2b42b9a51b20 |
13 | 12b56a05b678 |
14 | 77d41b4a4c0 |
15 | 3be1d3ca4d0 |
hex | 1fdac61ea08 |
2189030451720 has 512 divisors, whose sum is σ = 8283716812800. Its totient is φ = 451196928000.
The previous prime is 2189030451719. The next prime is 2189030451761. The reversal of 2189030451720 is 271540309812.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 54229545 + ... + 54269895.
It is an arithmetic number, because the mean of its divisors is an integer number (16179134400).
Almost surely, 22189030451720 is an apocalyptic number.
2189030451720 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 2189030451720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4141858406400).
2189030451720 is an abundant number, since it is smaller than the sum of its proper divisors (6094686361080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2189030451720 is a wasteful number, since it uses less digits than its factorization.
2189030451720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40549 (or 40545 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 42.
The spelling of 2189030451720 in words is "two trillion, one hundred eighty-nine billion, thirty million, four hundred fifty-one thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •