Base | Representation |
---|---|
bin | 10111101101100010101001… |
… | …11010010010001010001000 |
3 | 20211121202110110101012011210 |
4 | 23312301110322102022020 |
5 | 23313244441322211222 |
6 | 302521504331253120 |
7 | 13661105325143364 |
oct | 1366612472221210 |
9 | 224552413335153 |
10 | 52142327538312 |
11 | 15683489602aa0 |
12 | 5a21647baa1a0 |
13 | 2313000b13b2b |
14 | cc39b88822a4 |
15 | 60651cd6ed0c |
hex | 2f6c54e92288 |
52142327538312 has 128 divisors (see below), whose sum is σ = 146970741657600. Its totient is φ = 15272558035200.
The previous prime is 52142327538307. The next prime is 52142327538349. The reversal of 52142327538312 is 21383572324125.
It is a super-2 number, since 2×521423275383122 (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, 2941803 + ... + 10627269.
It is an arithmetic number, because the mean of its divisors is an integer number (1148208919200).
Almost surely, 252142327538312 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 52142327538312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73485370828800).
52142327538312 is an abundant number, since it is smaller than the sum of its proper divisors (94828414119288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52142327538312 is a wasteful number, since it uses less digits than its factorization.
52142327538312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7686347 (or 7686343 counting only the distinct ones).
The product of its digits is 2419200, while the sum is 48.
The spelling of 52142327538312 in words is "fifty-two trillion, one hundred forty-two billion, three hundred twenty-seven million, five hundred thirty-eight thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •