Base | Representation |
---|---|
bin | 110000100010010101… |
… | …110100010011011000 |
3 | 11222112000222111221200 |
4 | 300202111310103120 |
5 | 1323213113032102 |
6 | 35535221234200 |
7 | 3523322404242 |
oct | 604225642330 |
9 | 158460874850 |
10 | 52115752152 |
11 | 20113a8aa52 |
12 | a125562960 |
13 | 4bb71b4689 |
14 | 274571b092 |
15 | 15504be51c |
hex | c225744d8 |
52115752152 has 24 divisors (see below), whose sum is σ = 141146828940. Its totient is φ = 17371917360.
The previous prime is 52115752151. The next prime is 52115752153. The reversal of 52115752152 is 25125751125.
52115752152 is a `hidden beast` number, since 5 + 2 + 11 + 575 + 21 + 52 = 666.
It is an interprime number because it is at equal distance from previous prime (52115752151) and next prime (52115752153).
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×521157521522 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52115752151) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 361914874 + ... + 361915017.
Almost surely, 252115752152 is an apocalyptic number.
It is an amenable number.
52115752152 is an abundant number, since it is smaller than the sum of its proper divisors (89031076788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52115752152 is a wasteful number, since it uses less digits than its factorization.
52115752152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 723829903 (or 723829896 counting only the distinct ones).
The product of its digits is 35000, while the sum is 36.
The spelling of 52115752152 in words is "fifty-two billion, one hundred fifteen million, seven hundred fifty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •