Base | Representation |
---|---|
bin | 1001010100011011… |
… | …01100011000010101 |
3 | 110220200101220011111 |
4 | 10222031230120111 |
5 | 40221304400041 |
6 | 2144243535021 |
7 | 234661332661 |
oct | 45215543025 |
9 | 13820356144 |
10 | 5003200021 |
11 | 21381a3256 |
12 | b7768a471 |
13 | 61970c2b1 |
14 | 3566958a1 |
15 | 1e4389981 |
hex | 12a36c615 |
5003200021 has 2 divisors, whose sum is σ = 5003200022. Its totient is φ = 5003200020.
The previous prime is 5003200003. The next prime is 5003200049. The reversal of 5003200021 is 1200023005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3960814225 + 1042385796 = 62935^2 + 32286^2 .
It is a cyclic number.
It is not a de Polignac number, because 5003200021 - 25 = 5003199989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5003199974 and 5003200010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5003200001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2501600010 + 2501600011.
It is an arithmetic number, because the mean of its divisors is an integer number (2501600011).
Almost surely, 25003200021 is an apocalyptic number.
It is an amenable number.
5003200021 is a deficient number, since it is larger than the sum of its proper divisors (1).
5003200021 is an equidigital number, since it uses as much as digits as its factorization.
5003200021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 13.
The square root of 5003200021 is about 70733.3020648690. The cubic root of 5003200021 is about 1710.3406661430.
Adding to 5003200021 its reverse (1200023005), we get a palindrome (6203223026).
It can be divided in two parts, 500 and 3200021, that added together give a square (3200521 = 17892).
The spelling of 5003200021 in words is "five billion, three million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •