Base | Representation |
---|---|
bin | 110001011000111111… |
… | …011110011010011001 |
3 | 12001212221021100122101 |
4 | 301120333132122121 |
5 | 1332102324022301 |
6 | 40210213323401 |
7 | 3555125010130 |
oct | 613077363231 |
9 | 161787240571 |
10 | 53032642201 |
11 | 205445a9020 |
12 | a340636561 |
13 | 5002142a76 |
14 | 27d13d2917 |
15 | 15a5c35701 |
hex | c58fde699 |
53032642201 has 16 divisors (see below), whose sum is σ = 66556505088. Its totient is φ = 41050458000.
The previous prime is 53032642193. The next prime is 53032642211. The reversal of 53032642201 is 10224623035.
It is a cyclic number.
It is not a de Polignac number, because 53032642201 - 23 = 53032642193 is a prime.
It is a super-2 number, since 2×530326422012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 53032642201.
It is not an unprimeable number, because it can be changed into a prime (53032642211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2268955 + ... + 2292208.
It is an arithmetic number, because the mean of its divisors is an integer number (4159781568).
Almost surely, 253032642201 is an apocalyptic number.
It is an amenable number.
53032642201 is a deficient number, since it is larger than the sum of its proper divisors (13523862887).
53032642201 is a wasteful number, since it uses less digits than its factorization.
53032642201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4561332.
The product of its (nonzero) digits is 8640, while the sum is 28.
The spelling of 53032642201 in words is "fifty-three billion, thirty-two million, six hundred forty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •