Base | Representation |
---|---|
bin | 1001100111110100… |
… | …01010000111110001 |
3 | 111100000110102112022 |
4 | 10303322022013301 |
5 | 41034424213441 |
6 | 2212334041225 |
7 | 242005003304 |
oct | 46372120761 |
9 | 14300412468 |
10 | 5165851121 |
11 | 2210a96452 |
12 | 1002049215 |
13 | 64431a652 |
14 | 370114b3b |
15 | 2037b784b |
hex | 133e8a1f1 |
5165851121 has 4 divisors (see below), whose sum is σ = 5166191472. Its totient is φ = 5165510772.
The previous prime is 5165851091. The next prime is 5165851123. The reversal of 5165851121 is 1211585615.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1211585615 = 5 ⋅242317123.
It is a cyclic number.
It is not a de Polignac number, because 5165851121 - 230 = 4092109297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5165851123) 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 3 ways as a sum of consecutive naturals, for example, 146291 + ... + 178136.
It is an arithmetic number, because the mean of its divisors is an integer number (1291547868).
Almost surely, 25165851121 is an apocalyptic number.
It is an amenable number.
5165851121 is a deficient number, since it is larger than the sum of its proper divisors (340351).
5165851121 is a wasteful number, since it uses less digits than its factorization.
5165851121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340350.
The product of its digits is 12000, while the sum is 35.
The square root of 5165851121 is about 71873.8556152375. The cubic root of 5165851121 is about 1728.6774304762.
The spelling of 5165851121 in words is "five billion, one hundred sixty-five million, eight hundred fifty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •