Base | Representation |
---|---|
bin | 110010110100110000… |
… | …100010001010000000 |
3 | 12012212020021111000212 |
4 | 302310300202022000 |
5 | 1343230442313443 |
6 | 41023052133252 |
7 | 3641231203115 |
oct | 626460421200 |
9 | 165766244025 |
10 | 54572229248 |
11 | 21164667609 |
12 | a6b0167228 |
13 | 51b90b5914 |
14 | 28d9a7c90c |
15 | 1645e9e618 |
hex | cb4c22280 |
54572229248 has 64 divisors (see below), whose sum is σ = 115889136000. Its totient is φ = 25522698240.
The previous prime is 54572229247. The next prime is 54572229253. The reversal of 54572229248 is 84292227545.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 54572229196 and 54572229205.
It is not an unprimeable number, because it can be changed into a prime (54572229247) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50108 + ... + 334148.
It is an arithmetic number, because the mean of its divisors is an integer number (1810767750).
Almost surely, 254572229248 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 54572229248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57944568000).
54572229248 is an abundant number, since it is smaller than the sum of its proper divisors (61316906752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54572229248 is a wasteful number, since it uses less digits than its factorization.
54572229248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 284153 (or 284141 counting only the distinct ones).
The product of its digits is 3225600, while the sum is 50.
The spelling of 54572229248 in words is "fifty-four billion, five hundred seventy-two million, two hundred twenty-nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •