Base | Representation |
---|---|
bin | 1001100000011100… |
… | …10000001111101101 |
3 | 111011201002120202121 |
4 | 10300032100033231 |
5 | 40423111311341 |
6 | 2202244352541 |
7 | 240324241162 |
oct | 46016201755 |
9 | 14151076677 |
10 | 5104010221 |
11 | 218a098472 |
12 | ba53a5751 |
13 | 6345777bb |
14 | 365c18069 |
15 | 1ed14e4d1 |
hex | 1303903ed |
5104010221 has 4 divisors (see below), whose sum is σ = 5268655744. Its totient is φ = 4939364700.
The previous prime is 5104010209. The next prime is 5104010227. The reversal of 5104010221 is 1220104015.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5104010221 - 217 = 5103879149 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5104010195 and 5104010204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5104010227) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82322715 + ... + 82322776.
It is an arithmetic number, because the mean of its divisors is an integer number (1317163936).
Almost surely, 25104010221 is an apocalyptic number.
It is an amenable number.
5104010221 is a deficient number, since it is larger than the sum of its proper divisors (164645523).
5104010221 is a wasteful number, since it uses less digits than its factorization.
5104010221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164645522.
The product of its (nonzero) digits is 80, while the sum is 16.
The square root of 5104010221 is about 71442.3559311981. The cubic root of 5104010221 is about 1721.7516656559.
Adding to 5104010221 its reverse (1220104015), we get a palindrome (6324114236).
The spelling of 5104010221 in words is "five billion, one hundred four million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •