Base | Representation |
---|---|
bin | 1001101100000001… |
… | …00111111101101101 |
3 | 111102110210021210112 |
4 | 10312000213331231 |
5 | 41122440210103 |
6 | 2220033345405 |
7 | 242613424520 |
oct | 46600477555 |
9 | 14373707715 |
10 | 5201100653 |
11 | 22299819a1 |
12 | 1011a08265 |
13 | 64b70cb68 |
14 | 374a8cbb7 |
15 | 20692bcd8 |
hex | 136027f6d |
5201100653 has 8 divisors (see below), whose sum is σ = 6202555008. Its totient is φ = 4264256304.
The previous prime is 5201100631. The next prime is 5201100677. The reversal of 5201100653 is 3560011025.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5201100653 - 212 = 5201096557 is a prime.
It is a super-3 number, since 3×52011006533 (a number of 30 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5201100623) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16152326 + ... + 16152647.
It is an arithmetic number, because the mean of its divisors is an integer number (775319376).
Almost surely, 25201100653 is an apocalyptic number.
It is an amenable number.
5201100653 is a deficient number, since it is larger than the sum of its proper divisors (1001454355).
5201100653 is a wasteful number, since it uses less digits than its factorization.
5201100653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32305003.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 5201100653 is about 72118.6567609242. The cubic root of 5201100653 is about 1732.6004365035.
Adding to 5201100653 its reverse (3560011025), we get a palindrome (8761111678).
The spelling of 5201100653 in words is "five billion, two hundred one million, one hundred thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •