Base | Representation |
---|---|
bin | 11000111100111110100111… |
… | …01010010010011010010000 |
3 | 21012021200121011212020201212 |
4 | 30132133103222102122100 |
5 | 24143004330110100212 |
6 | 312411423204515252 |
7 | 14362232215531505 |
oct | 1436372352223220 |
9 | 235250534766655 |
10 | 54871758284432 |
11 | 16535a89058651 |
12 | 61a26209abb28 |
13 | 24804ccc880bb |
14 | d79b4321d4ac |
15 | 652518a85e22 |
hex | 31e7d3a92690 |
54871758284432 has 40 divisors (see below), whose sum is σ = 112060125936960. Its totient is φ = 25956903047040.
The previous prime is 54871758284411. The next prime is 54871758284437. The reversal of 54871758284432 is 23448285717845.
54871758284432 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (54871758284437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121240619 + ... + 121692362.
It is an arithmetic number, because the mean of its divisors is an integer number (2801503148424).
Almost surely, 254871758284432 is an apocalyptic number.
It is an amenable number.
54871758284432 is an abundant number, since it is smaller than the sum of its proper divisors (57188367652528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54871758284432 is a wasteful number, since it uses less digits than its factorization.
54871758284432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242933751 (or 242933745 counting only the distinct ones).
The product of its digits is 481689600, while the sum is 68.
The spelling of 54871758284432 in words is "fifty-four trillion, eight hundred seventy-one billion, seven hundred fifty-eight million, two hundred eighty-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •