Base | Representation |
---|---|
bin | 10111011001011111011000… |
… | …00000111110110110100000 |
3 | 20202011220011000201021112220 |
4 | 23230233230000332312200 |
5 | 23221003001431403300 |
6 | 301233204142551040 |
7 | 13560245355411450 |
oct | 1354575400766640 |
9 | 222156130637486 |
10 | 51453372919200 |
11 | 1543828669855a |
12 | 5930012598480 |
13 | 2293055b00335 |
14 | c9c4dc4a1d60 |
15 | 5e364881cda0 |
hex | 2ecbec03eda0 |
51453372919200 has 1152 divisors, whose sum is σ = 206782285086720. Its totient is φ = 10854297907200.
The previous prime is 51453372919163. The next prime is 51453372919211. The reversal of 51453372919200 is 291927335415.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 4156498611 + ... + 4156510989.
It is an arithmetic number, because the mean of its divisors is an integer number (179498511360).
Almost surely, 251453372919200 is an apocalyptic number.
51453372919200 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 51453372919200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103391142543360).
51453372919200 is an abundant number, since it is smaller than the sum of its proper divisors (155328912167520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51453372919200 is a wasteful number, since it uses less digits than its factorization.
51453372919200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12810 (or 12797 counting only the distinct ones).
The product of its (nonzero) digits is 2041200, while the sum is 51.
The spelling of 51453372919200 in words is "fifty-one trillion, four hundred fifty-three billion, three hundred seventy-two million, nine hundred nineteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •