Base | Representation |
---|---|
bin | 1001011011110011… |
… | …00001001011011001 |
3 | 111001222201200101211 |
4 | 10231321201023121 |
5 | 40333121120441 |
6 | 2154332543121 |
7 | 236341650340 |
oct | 45571411331 |
9 | 14058650354 |
10 | 5065020121 |
11 | 216a087647 |
12 | b94321aa1 |
13 | 629475835 |
14 | 360988b57 |
15 | 1e99eba81 |
hex | 12de612d9 |
5065020121 has 16 divisors (see below), whose sum is σ = 5822264448. Its totient is φ = 4316256000.
The previous prime is 5065020083. The next prime is 5065020127. The reversal of 5065020121 is 1210205605.
It is not a de Polignac number, because 5065020121 - 213 = 5065011929 is a prime.
It is a super-2 number, since 2×50650201212 = 51308857652269709282, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5065020092 and 5065020101.
It is not an unprimeable number, because it can be changed into a prime (5065020127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1180446 + ... + 1184728.
It is an arithmetic number, because the mean of its divisors is an integer number (363891528).
Almost surely, 25065020121 is an apocalyptic number.
It is an amenable number.
5065020121 is a deficient number, since it is larger than the sum of its proper divisors (757244327).
5065020121 is a wasteful number, since it uses less digits than its factorization.
5065020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5232.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 5065020121 is about 71168.9547555674. The cubic root of 5065020121 is about 1717.3562369011.
Adding to 5065020121 its reverse (1210205605), we get a palindrome (6275225726).
The spelling of 5065020121 in words is "five billion, sixty-five million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •