Base | Representation |
---|---|
bin | 10111111011111011000100… |
… | …01110100101001110001000 |
3 | 20220100222221020202000011220 |
4 | 23331331202032211032020 |
5 | 23344343443340431440 |
6 | 303540510030322040 |
7 | 14041600564401042 |
oct | 1375754216451610 |
9 | 226328836660156 |
10 | 52636472202120 |
11 | 15854003367774 |
12 | 5aa1374059320 |
13 | 234a7a0b46c21 |
14 | cdd894192a92 |
15 | 6142de8e38d0 |
hex | 2fdf623a5388 |
52636472202120 has 256 divisors, whose sum is σ = 162243802517760. Its totient is φ = 13656384000000.
The previous prime is 52636472202103. The next prime is 52636472202163. The reversal of 52636472202120 is 2120227463625.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 776991450 + ... + 777059190.
It is an arithmetic number, because the mean of its divisors is an integer number (633764853585).
Almost surely, 252636472202120 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 52636472202120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81121901258880).
52636472202120 is an abundant number, since it is smaller than the sum of its proper divisors (109607330315640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52636472202120 is a wasteful number, since it uses less digits than its factorization.
52636472202120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68968 (or 68964 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 42.
Adding to 52636472202120 its reverse (2120227463625), we get a palindrome (54756699665745).
The spelling of 52636472202120 in words is "fifty-two trillion, six hundred thirty-six billion, four hundred seventy-two million, two hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •