Base | Representation |
---|---|
bin | 1010001001111101… |
… | …10110010110000000 |
3 | 112001222110012121110 |
4 | 11010332312112000 |
5 | 42131241343004 |
6 | 2301005323320 |
7 | 252053505300 |
oct | 50476662600 |
9 | 15058405543 |
10 | 5452293504 |
11 | 234874a899 |
12 | 1081b66540 |
13 | 68b77c498 |
14 | 39a199600 |
15 | 21d9e9589 |
hex | 144fb6580 |
5452293504 has 384 divisors, whose sum is σ = 18028051200. Its totient is φ = 1451520000.
The previous prime is 5452293503. The next prime is 5452293527. The reversal of 5452293504 is 4053922545.
It is a tau number, because it is divible by the number of its divisors (384).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5452293503) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 36107829 + ... + 36107979.
It is an arithmetic number, because the mean of its divisors is an integer number (46948050).
Almost surely, 25452293504 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 5452293504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9014025600).
5452293504 is an abundant number, since it is smaller than the sum of its proper divisors (12575757696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5452293504 is a wasteful number, since it uses less digits than its factorization.
5452293504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302 (or 283 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 39.
The square root of 5452293504 is about 73839.6472364271. The cubic root of 5452293504 is about 1760.0556869433.
The spelling of 5452293504 in words is "five billion, four hundred fifty-two million, two hundred ninety-three thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •