Base | Representation |
---|---|
bin | 11000100100100010101011… |
… | …10001001101000101001100 |
3 | 21002022102100212111101110010 |
4 | 30102101111301031011030 |
5 | 24040230244122430201 |
6 | 310530003340113220 |
7 | 14244456330154200 |
oct | 1422212561150514 |
9 | 232272325441403 |
10 | 54032127545676 |
11 | 162419954262a5 |
12 | 6087956235810 |
13 | 241c2915c7467 |
14 | d4b25176cb00 |
15 | 63a7763ecbd6 |
hex | 312455c4d14c |
54032127545676 has 144 divisors (see below), whose sum is σ = 149299167075072. Its totient is φ = 15160602038400.
The previous prime is 54032127545663. The next prime is 54032127545707. The reversal of 54032127545676 is 67654572123045.
It is a super-2 number, since 2×540321275456762 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21439035 + ... + 23826381.
Almost surely, 254032127545676 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 54032127545676, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74649583537536).
54032127545676 is an abundant number, since it is smaller than the sum of its proper divisors (95267039529396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54032127545676 is a wasteful number, since it uses less digits than its factorization.
54032127545676 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2388060 (or 2388051 counting only the distinct ones).
The product of its (nonzero) digits is 42336000, while the sum is 57.
The spelling of 54032127545676 in words is "fifty-four trillion, thirty-two billion, one hundred twenty-seven million, five hundred forty-five thousand, six hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •