Base | Representation |
---|---|
bin | 101100010110110000111… |
… | …0000001000010110001000 |
3 | 210120210100120011202210000 |
4 | 1120231201300020112020 |
5 | 1244340003320200242 |
6 | 20544315512523000 |
7 | 1166302325060100 |
oct | 130554160102610 |
9 | 23523316152700 |
10 | 6096198600072 |
11 | 1a40424200519 |
12 | 8255986b0460 |
13 | 352b3b434b69 |
14 | 1710b4036200 |
15 | a88995cba4c |
hex | 58b61c08588 |
6096198600072 has 480 divisors, whose sum is σ = 20163932363520. Its totient is φ = 1715431011840.
The previous prime is 6096198600017. The next prime is 6096198600113. The reversal of 6096198600072 is 2700068916906.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 6096198599991 and 6096198600018.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 2111601813 + ... + 2111604699.
It is an arithmetic number, because the mean of its divisors is an integer number (42008192424).
Almost surely, 26096198600072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6096198600072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10081966181760).
6096198600072 is an abundant number, since it is smaller than the sum of its proper divisors (14067733763448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6096198600072 is a wasteful number, since it uses less digits than its factorization.
6096198600072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3903 (or 3883 counting only the distinct ones).
The product of its (nonzero) digits is 1959552, while the sum is 54.
The spelling of 6096198600072 in words is "six trillion, ninety-six billion, one hundred ninety-eight million, six hundred thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •