Base | Representation |
---|---|
bin | 10111101101011110011111… |
… | …11011000111010000000000 |
3 | 20211121112200222001220122202 |
4 | 23312233033323013100000 |
5 | 23313230404133323143 |
6 | 302520455110052332 |
7 | 13660666123516316 |
oct | 1366571773072000 |
9 | 224545628056582 |
10 | 52140096386048 |
11 | 15682544136300 |
12 | 5a2112494a0a8 |
13 | 2312a367c5ba8 |
14 | cc38464160b6 |
15 | 60643c04cab8 |
hex | 2f6bcfec7400 |
52140096386048 has 132 divisors (see below), whose sum is σ = 114751313570880. Its totient is φ = 23661721374720.
The previous prime is 52140096386017. The next prime is 52140096386071. The reversal of 52140096386048 is 84068369004125.
It is a super-2 number, since 2×521400963860482 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 52140096385984 and 52140096386002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 76356665 + ... + 77036487.
Almost surely, 252140096386048 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 52140096386048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57375656785440).
52140096386048 is an abundant number, since it is smaller than the sum of its proper divisors (62611217184832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52140096386048 is a wasteful number, since it uses less digits than its factorization.
52140096386048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680484 (or 680455 counting only the distinct ones).
The product of its (nonzero) digits is 9953280, while the sum is 56.
The spelling of 52140096386048 in words is "fifty-two trillion, one hundred forty billion, ninety-six million, three hundred eighty-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •