Base | Representation |
---|---|
bin | 10111001111101000110001… |
… | …01010010011011100010000 |
3 | 20200222112021122210021202220 |
4 | 23213310120222103130100 |
5 | 23144431122300020220 |
6 | 300413453544541040 |
7 | 13523631610202010 |
oct | 1347643052233420 |
9 | 220875248707686 |
10 | 51114819532560 |
11 | 1531774507a253 |
12 | 5896489781780 |
13 | 226a15083b714 |
14 | c89d82d59c40 |
15 | 5d9931678540 |
hex | 2e7d18a93710 |
51114819532560 has 160 divisors (see below), whose sum is σ = 181125089633280. Its totient is φ = 11681284990464.
The previous prime is 51114819532523. The next prime is 51114819532591. The reversal of 51114819532560 is 6523591841115.
It is a super-2 number, since 2×511148195325602 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6611211 + ... + 12080469.
It is an arithmetic number, because the mean of its divisors is an integer number (1132031810208).
Almost surely, 251114819532560 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 51114819532560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90562544816640).
51114819532560 is an abundant number, since it is smaller than the sum of its proper divisors (130010270100720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51114819532560 is a wasteful number, since it uses less digits than its factorization.
51114819532560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5474845 (or 5474839 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 51.
The spelling of 51114819532560 in words is "fifty-one trillion, one hundred fourteen billion, eight hundred nineteen million, five hundred thirty-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •