Base | Representation |
---|---|
bin | 1010000100110101… |
… | …11100000001100000 |
3 | 111221222121012010000 |
4 | 11002122330001200 |
5 | 42034241401102 |
6 | 2252432340000 |
7 | 251022335160 |
oct | 50232740140 |
9 | 14858535100 |
10 | 5409325152 |
11 | 2326472060 |
12 | 106b6a4600 |
13 | 6828b681a |
14 | 3945b25a0 |
15 | 219d5d01c |
hex | 1426bc060 |
5409325152 has 240 divisors, whose sum is σ = 19834924032. Its totient is φ = 1404967680.
The previous prime is 5409325147. The next prime is 5409325153. The reversal of 5409325152 is 2515239045.
It is a happy number.
5409325152 is a `hidden beast` number, since 54 + 0 + 93 + 2 + 515 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5409325153) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 186033 + ... + 213135.
Almost surely, 25409325152 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 5409325152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9917462016).
5409325152 is an abundant number, since it is smaller than the sum of its proper divisors (14425598880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5409325152 is a wasteful number, since it uses less digits than its factorization.
5409325152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27143 (or 27126 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The square root of 5409325152 is about 73548.1145373557. The cubic root of 5409325152 is about 1755.4199477181.
The spelling of 5409325152 in words is "five billion, four hundred nine million, three hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •