Base | Representation |
---|---|
bin | 11000011000111010010100… |
… | …10100001001110000110010 |
3 | 21000220012212101012111211201 |
4 | 30030131022110021300302 |
5 | 24012203331334001002 |
6 | 310022233144201414 |
7 | 14203551301152421 |
oct | 1414351224116062 |
9 | 230805771174751 |
10 | 53632503422002 |
11 | 160a8464a9239a |
12 | 6022408a6926a |
13 | 23c06a5b0235b |
14 | d35b814912b8 |
15 | 630187a00087 |
hex | 30c74a509c32 |
53632503422002 has 8 divisors (see below), whose sum is σ = 80456847784812. Its totient is φ = 26813554160400.
The previous prime is 53632503421999. The next prime is 53632503422009. The reversal of 53632503422002 is 20022430523635.
It can be written as a sum of positive squares in 2 ways, for example, as 42688177237161 + 10944326184841 = 6533619^2 + 3308221^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×536325034220022 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (53632503422009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1348750449 + ... + 1348790212.
Almost surely, 253632503422002 is an apocalyptic number.
53632503422002 is a deficient number, since it is larger than the sum of its proper divisors (26824344362810).
53632503422002 is a wasteful number, since it uses less digits than its factorization.
53632503422002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2697550604.
The product of its (nonzero) digits is 259200, while the sum is 37.
Adding to 53632503422002 its reverse (20022430523635), we get a palindrome (73654933945637).
The spelling of 53632503422002 in words is "fifty-three trillion, six hundred thirty-two billion, five hundred three million, four hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •