Base | Representation |
---|---|
bin | 1010000100011110… |
… | …00101000011000000 |
3 | 111221202202020200110 |
4 | 11002033011003000 |
5 | 42032442411014 |
6 | 2252241551320 |
7 | 250654036542 |
oct | 50217050300 |
9 | 14852666613 |
10 | 5406216384 |
11 | 2324739428 |
12 | 106a645540 |
13 | 68206880a |
14 | 394003692 |
15 | 219946d59 |
hex | 1423c50c0 |
5406216384 has 56 divisors (see below), whose sum is σ = 14333329728. Its totient is φ = 1798370560.
The previous prime is 5406216383. The next prime is 5406216451. The reversal of 5406216384 is 4836126045.
It is a super-3 number, since 3×54062163843 (a number of 30 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (5406216383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65599 + ... + 122945.
Almost surely, 25406216384 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 5406216384, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7166664864).
5406216384 is an abundant number, since it is smaller than the sum of its proper divisors (8927113344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5406216384 is a wasteful number, since it uses less digits than its factorization.
5406216384 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57853 (or 57843 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 39.
The square root of 5406216384 is about 73526.9772532504. The cubic root of 5406216384 is about 1755.0836002091.
The spelling of 5406216384 in words is "five billion, four hundred six million, two hundred sixteen thousand, three hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •