Base | Representation |
---|---|
bin | 101001001000110010000… |
… | …0101100101110000010100 |
3 | 202000111120221210222211002 |
4 | 1102101210011211300110 |
5 | 1220113044133223000 |
6 | 20005202355002432 |
7 | 1122322553215310 |
oct | 122214405456024 |
9 | 22014527728732 |
10 | 5653856148500 |
11 | 188a87244459a |
12 | 773908b99418 |
13 | 320205657761 |
14 | 157910546b40 |
15 | 9c10a7418d5 |
hex | 52464165c14 |
5653856148500 has 192 divisors, whose sum is σ = 14159603727360. Its totient is φ = 1931939942400.
The previous prime is 5653856148439. The next prime is 5653856148527. The reversal of 5653856148500 is 58416583565.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2362663304 + ... + 2362665696.
It is an arithmetic number, because the mean of its divisors is an integer number (73747936080).
Almost surely, 25653856148500 is an apocalyptic number.
5653856148500 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 5653856148500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7079801863680).
5653856148500 is an abundant number, since it is smaller than the sum of its proper divisors (8505747578860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5653856148500 is a wasteful number, since it uses less digits than its factorization.
5653856148500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4411 (or 4399 counting only the distinct ones).
The product of its (nonzero) digits is 17280000, while the sum is 56.
The spelling of 5653856148500 in words is "five trillion, six hundred fifty-three billion, eight hundred fifty-six million, one hundred forty-eight thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •