Base | Representation |
---|---|
bin | 1001011010001000… |
… | …11011000000100101 |
3 | 111001000112112021000 |
4 | 10231010123000211 |
5 | 40321040214341 |
6 | 2153114343513 |
7 | 236112436425 |
oct | 45504330045 |
9 | 14030475230 |
10 | 5051101221 |
11 | 2162240121 |
12 | b8b72ab99 |
13 | 6266112ba |
14 | 35cba4485 |
15 | 1e869c8b6 |
hex | 12d11b025 |
5051101221 has 8 divisors (see below), whose sum is σ = 7483112960. Its totient is φ = 3367400796.
The previous prime is 5051101207. The next prime is 5051101259. The reversal of 5051101221 is 1221011505.
It is not a de Polignac number, because 5051101221 - 213 = 5051093029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5051101194 and 5051101203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5051101201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93538885 + ... + 93538938.
It is an arithmetic number, because the mean of its divisors is an integer number (935389120).
Almost surely, 25051101221 is an apocalyptic number.
It is an amenable number.
5051101221 is a deficient number, since it is larger than the sum of its proper divisors (2432011739).
5051101221 is a wasteful number, since it uses less digits than its factorization.
5051101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187077832 (or 187077826 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 18.
The square root of 5051101221 is about 71071.0997593255. The cubic root of 5051101221 is about 1715.7816699829.
Adding to 5051101221 its reverse (1221011505), we get a palindrome (6272112726).
The spelling of 5051101221 in words is "five billion, fifty-one million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •