Base | Representation |
---|---|
bin | 1001110010010101… |
… | …00011101111000000 |
3 | 111120011101201000100 |
4 | 10321022203233000 |
5 | 41230013131131 |
6 | 2225204122400 |
7 | 244125400266 |
oct | 47112435700 |
9 | 14504351010 |
10 | 5254036416 |
11 | 2256848362 |
12 | 1027696400 |
13 | 6596855b5 |
14 | 37bb0c436 |
15 | 20b3d67e6 |
hex | 1392a3bc0 |
5254036416 has 84 divisors (see below), whose sum is σ = 15120161784. Its totient is φ = 1744320000.
The previous prime is 5254036409. The next prime is 5254036433. The reversal of 5254036416 is 6146304525.
5254036416 is a `hidden beast` number, since 5 + 2 + 5 + 4 + 0 + 3 + 641 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 126406 + ... + 162746.
It is an arithmetic number, because the mean of its divisors is an integer number (180001926).
Almost surely, 25254036416 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 5254036416, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7560080892).
5254036416 is an abundant number, since it is smaller than the sum of its proper divisors (9866125368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5254036416 is a wasteful number, since it uses less digits than its factorization.
5254036416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36610 (or 36597 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The square root of 5254036416 is about 72484.7322958428. The cubic root of 5254036416 is about 1738.4586270563.
The spelling of 5254036416 in words is "five billion, two hundred fifty-four million, thirty-six thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •