Base | Representation |
---|---|
bin | 11001001110000001000001… |
… | …00101110011000011010100 |
3 | 21021100122122010221111210212 |
4 | 30213000200211303003110 |
5 | 24232102233103132200 |
6 | 313540400351504552 |
7 | 14452435143361505 |
oct | 1447004045630324 |
9 | 237318563844725 |
10 | 55457164505300 |
11 | 16741284663958 |
12 | 6277b78228158 |
13 | 24c37852a852c |
14 | d9a1d91c2bac |
15 | 66287c5d1035 |
hex | 3270209730d4 |
55457164505300 has 144 divisors (see below), whose sum is σ = 121536359008512. Its totient is φ = 21963899865600.
The previous prime is 55457164505279. The next prime is 55457164505311. The reversal of 55457164505300 is 350546175455.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a congruent number.
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, 4988495342 + ... + 4988506458.
Almost surely, 255457164505300 is an apocalyptic number.
55457164505300 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 55457164505300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60768179504256).
55457164505300 is an abundant number, since it is smaller than the sum of its proper divisors (66079194503212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55457164505300 is a wasteful number, since it uses less digits than its factorization.
55457164505300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12418 (or 12411 counting only the distinct ones).
The product of its (nonzero) digits is 6300000, while the sum is 50.
The spelling of 55457164505300 in words is "fifty-five trillion, four hundred fifty-seven billion, one hundred sixty-four million, five hundred five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •