Base | Representation |
---|---|
bin | 11000100111011111110010… |
… | …10000010100001111101100 |
3 | 21002200010102110121221010012 |
4 | 30103233321100110033230 |
5 | 24043411211041314000 |
6 | 311044354014032352 |
7 | 14255012266165466 |
oct | 1423577120241754 |
9 | 232603373557105 |
10 | 54133654635500 |
11 | 16280a54864600 |
12 | 60a356b4a86b8 |
13 | 2428a215c263b |
14 | d52123545136 |
15 | 63d219733735 |
hex | 313bf94143ec |
54133654635500 has 144 divisors (see below), whose sum is σ = 130155180591072. Its totient is φ = 19654336944000.
The previous prime is 54133654635499. The next prime is 54133654635583. The reversal of 54133654635500 is 553645633145.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 38205722 + ... + 39597278.
Almost surely, 254133654635500 is an apocalyptic number.
54133654635500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 54133654635500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65077590295536).
54133654635500 is an abundant number, since it is smaller than the sum of its proper divisors (76021525955572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54133654635500 is a wasteful number, since it uses less digits than its factorization.
54133654635500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1392241 (or 1392218 counting only the distinct ones).
The product of its (nonzero) digits is 9720000, while the sum is 50.
The spelling of 54133654635500 in words is "fifty-four trillion, one hundred thirty-three billion, six hundred fifty-four million, six hundred thirty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •