Base | Representation |
---|---|
bin | 100110100000011010100… |
… | …0110101010010011010000 |
3 | 200201221022211112110022220 |
4 | 1031000311012222103100 |
5 | 1143202102401202443 |
6 | 15131124511301040 |
7 | 1054232616161433 |
oct | 115006506522320 |
9 | 20657284473286 |
10 | 5292290647248 |
11 | 17604a2111a50 |
12 | 71582151a780 |
13 | 2c50a3954787 |
14 | 144210a7b81a |
15 | 929e8197a83 |
hex | 4d0351aa4d0 |
5292290647248 has 160 divisors (see below), whose sum is σ = 15822177887232. Its totient is φ = 1506500352000.
The previous prime is 5292290647207. The next prime is 5292290647279. The reversal of 5292290647248 is 8427460922925.
It is a junction number, because it is equal to n+sod(n) for n = 5292290647191 and 5292290647200.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 4130773 + ... + 5258123.
Almost surely, 25292290647248 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 5292290647248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7911088943616).
5292290647248 is an abundant number, since it is smaller than the sum of its proper divisors (10529887239984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5292290647248 is a wasteful number, since it uses less digits than its factorization.
5292290647248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1127913 (or 1127907 counting only the distinct ones).
The product of its (nonzero) digits is 34836480, while the sum is 60.
The spelling of 5292290647248 in words is "five trillion, two hundred ninety-two billion, two hundred ninety million, six hundred forty-seven thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •