Base | Representation |
---|---|
bin | 100111001111010011000… |
… | …1011110100011000101000 |
3 | 201002120012111101210021110 |
4 | 1032132212023310120220 |
5 | 1201324301322304423 |
6 | 15245255215510320 |
7 | 1064425606156440 |
oct | 116364613643050 |
9 | 21076174353243 |
10 | 5392972072488 |
11 | 179a16815aa00 |
12 | 73123b5283a0 |
13 | 30172a69bb00 |
14 | 1490423dd120 |
15 | 9543c136193 |
hex | 4e7a62f4628 |
5392972072488 has 1152 divisors, whose sum is σ = 19200783974400. Its totient is φ = 1233543168000.
The previous prime is 5392972072463. The next prime is 5392972072489. The reversal of 5392972072488 is 8842702792935.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is not an unprimeable number, because it can be changed into a prime (5392972072489) by changing a digit.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 8413372648 + ... + 8413373288.
It is an arithmetic number, because the mean of its divisors is an integer number (16667347200).
Almost surely, 25392972072488 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 5392972072488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9600391987200).
5392972072488 is an abundant number, since it is smaller than the sum of its proper divisors (13807811901912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5392972072488 is a wasteful number, since it uses less digits than its factorization.
5392972072488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 815 (or 787 counting only the distinct ones).
The product of its (nonzero) digits is 121927680, while the sum is 66.
The spelling of 5392972072488 in words is "five trillion, three hundred ninety-two billion, nine hundred seventy-two million, seventy-two thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •