Base | Representation |
---|---|
bin | 11100111001111101110… |
… | …00111001101011010000 |
3 | 10111221121022000002100220 |
4 | 32130332320321223100 |
5 | 112233024243032242 |
6 | 2040133311113040 |
7 | 131520144242223 |
oct | 16347670715320 |
9 | 3457538002326 |
10 | 993192549072 |
11 | 353235335299 |
12 | 1405a2212780 |
13 | 72871b3b679 |
14 | 360dc2cd5ba |
15 | 1ac7dcd3bec |
hex | e73ee39ad0 |
993192549072 has 40 divisors (see below), whose sum is σ = 2585333292960. Its totient is φ = 328536973440.
The previous prime is 993192549067. The next prime is 993192549211. The reversal of 993192549072 is 270945291399.
It is a super-2 number, since 2×9931925490722 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 993192548997 and 993192549015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78968947 + ... + 78981522.
It is an arithmetic number, because the mean of its divisors is an integer number (64633332324).
Almost surely, 2993192549072 is an apocalyptic number.
It is an amenable number.
993192549072 is an abundant number, since it is smaller than the sum of its proper divisors (1592140743888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
993192549072 is a wasteful number, since it uses less digits than its factorization.
993192549072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157950611 (or 157950605 counting only the distinct ones).
The product of its (nonzero) digits is 11022480, while the sum is 60.
The spelling of 993192549072 in words is "nine hundred ninety-three billion, one hundred ninety-two million, five hundred forty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •