Base | Representation |
---|---|
bin | 110010111010001011… |
… | …000010100100100000 |
3 | 12020002120012100200000 |
4 | 302322023002210200 |
5 | 1343422221020330 |
6 | 41040055100000 |
7 | 3643413243030 |
oct | 627213024440 |
9 | 166076170600 |
10 | 54663063840 |
11 | 21200968a20 |
12 | a716671600 |
13 | 5201b6a6b8 |
14 | 2907b658c0 |
15 | 164de43560 |
hex | cba2c2920 |
54663063840 has 1728 divisors, whose sum is σ = 262327403520. Its totient is φ = 10413619200.
The previous prime is 54663063803. The next prime is 54663063841. The reversal of 54663063840 is 4836036645.
54663063840 is a `hidden beast` number, since 5 + 4 + 6 + 6 + 3 + 0 + 638 + 4 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54663063841) by changing a digit.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 1763324625 + ... + 1763324655.
It is an arithmetic number, because the mean of its divisors is an integer number (151809840).
Almost surely, 254663063840 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 54663063840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131163701760).
54663063840 is an abundant number, since it is smaller than the sum of its proper divisors (207664339680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54663063840 is a wasteful number, since it uses less digits than its factorization.
54663063840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129 (or 78 counting only the distinct ones).
The product of its (nonzero) digits is 1244160, while the sum is 45.
The spelling of 54663063840 in words is "fifty-four billion, six hundred sixty-three million, sixty-three thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •