Base | Representation |
---|---|
bin | 10000011100011101001110… |
… | …101100110000010000000000 |
3 | 100111002010121001102202010220 |
4 | 100130131032230300100000 |
5 | 33434430103302332120 |
6 | 413453151343423040 |
7 | 21143153643142206 |
oct | 2034351654602000 |
9 | 314063531382126 |
10 | 72324274652160 |
11 | 21054609607703 |
12 | 8140b192b4a80 |
13 | 31481c425a47b |
14 | 13c0729349076 |
15 | 8564c1326b40 |
hex | 41c74eb30400 |
72324274652160 has 176 divisors, whose sum is σ = 231376219319616. Its totient is φ = 19282175557632.
The previous prime is 72324274652129. The next prime is 72324274652183. The reversal of 72324274652160 is 6125647242327.
It is a super-2 number, since 2×723242746521602 (a number of 29 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 68705154 + ... + 69749886.
Almost surely, 272324274652160 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 72324274652160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115688109659808).
72324274652160 is an abundant number, since it is smaller than the sum of its proper divisors (159051944667456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72324274652160 is a wasteful number, since it uses less digits than its factorization.
72324274652160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049268 (or 1049250 counting only the distinct ones).
The product of its (nonzero) digits is 6773760, while the sum is 51.
The spelling of 72324274652160 in words is "seventy-two trillion, three hundred twenty-four billion, two hundred seventy-four million, six hundred fifty-two thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •