Base | Representation |
---|---|
bin | 110001011000111101… |
… | …011010100011010101 |
3 | 12001212220020220202200 |
4 | 301120331122203111 |
5 | 1332102204231401 |
6 | 40210153555113 |
7 | 3555120300366 |
oct | 613075324325 |
9 | 161786226680 |
10 | 53032102101 |
11 | 2054426a260 |
12 | a340415a99 |
13 | 5001cb3c94 |
14 | 27d12d1b6d |
15 | 15a5b7a686 |
hex | c58f5a8d5 |
53032102101 has 48 divisors (see below), whose sum is σ = 86303293440. Its totient is φ = 31088772000.
The previous prime is 53032102099. The next prime is 53032102129. The reversal of 53032102101 is 10120123035.
53032102101 is a `hidden beast` number, since 530 + 32 + 1 + 0 + 2 + 101 = 666.
It is not a de Polignac number, because 53032102101 - 21 = 53032102099 is a prime.
It is a super-2 number, since 2×530321021012 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53032102181) 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 47 ways as a sum of consecutive naturals, for example, 11141160 + ... + 11145918.
It is an arithmetic number, because the mean of its divisors is an integer number (1797985280).
Almost surely, 253032102101 is an apocalyptic number.
It is an amenable number.
53032102101 is a deficient number, since it is larger than the sum of its proper divisors (33271191339).
53032102101 is a wasteful number, since it uses less digits than its factorization.
53032102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8438 (or 8435 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
Adding to 53032102101 its reverse (10120123035), we get a palindrome (63152225136).
The spelling of 53032102101 in words is "fifty-three billion, thirty-two million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •