Base | Representation |
---|---|
bin | 10000100001010001110110… |
… | …001101110100010000101100 |
3 | 100112020210221011211022012202 |
4 | 100201101312031310100230 |
5 | 34010342232412100211 |
6 | 414305313405521032 |
7 | 21206124512112200 |
oct | 2041216615642054 |
9 | 315223834738182 |
10 | 72655650112556 |
11 | 211720a73a5765 |
12 | 819519a273178 |
13 | 31705243ba154 |
14 | 13d27a345ab00 |
15 | 85ee1825853b |
hex | 42147637442c |
72655650112556 has 72 divisors (see below), whose sum is σ = 149672381760720. Its totient is φ = 30767333732352.
The previous prime is 72655650112547. The next prime is 72655650112579. The reversal of 72655650112556 is 65521105655627.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8681540 + ... + 14855316.
It is an arithmetic number, because the mean of its divisors is an integer number (2078783080010).
Almost surely, 272655650112556 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 72655650112556, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74836190880360).
72655650112556 is an abundant number, since it is smaller than the sum of its proper divisors (77016731648164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72655650112556 is a wasteful number, since it uses less digits than its factorization.
72655650112556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6174511 (or 6174502 counting only the distinct ones).
The product of its (nonzero) digits is 18900000, while the sum is 56.
The spelling of 72655650112556 in words is "seventy-two trillion, six hundred fifty-five billion, six hundred fifty million, one hundred twelve thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •