Base | Representation |
---|---|
bin | 1010000111100110… |
… | …10010000110100000 |
3 | 112000121011210102121 |
4 | 11003303102012200 |
5 | 42111203444011 |
6 | 2255020554024 |
7 | 251423232343 |
oct | 50363220640 |
9 | 15017153377 |
10 | 5432484256 |
11 | 233854a911 |
12 | 10773b2914 |
13 | 687634b34 |
14 | 3976c045a |
15 | 21bdd4e71 |
hex | 143cd21a0 |
5432484256 has 96 divisors (see below), whose sum is σ = 11583129600. Its totient is φ = 2499563520.
The previous prime is 5432484251. The next prime is 5432484257. The reversal of 5432484256 is 6524842345.
It is not an unprimeable number, because it can be changed into a prime (5432484251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9547140 + ... + 9547708.
It is an arithmetic number, because the mean of its divisors is an integer number (120657600).
Almost surely, 25432484256 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 5432484256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5791564800).
5432484256 is an abundant number, since it is smaller than the sum of its proper divisors (6150645344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5432484256 is a wasteful number, since it uses less digits than its factorization.
5432484256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1022 (or 1014 counting only the distinct ones).
The product of its digits is 921600, while the sum is 43.
The square root of 5432484256 is about 73705.3882426516. The cubic root of 5432484256 is about 1757.9215581739.
The spelling of 5432484256 in words is "five billion, four hundred thirty-two million, four hundred eighty-four thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •