Base | Representation |
---|---|
bin | 1001100111011001… |
… | …10011110111111001 |
3 | 111022202212122210201 |
4 | 10303230303313321 |
5 | 41033030231441 |
6 | 2212131042201 |
7 | 241633161163 |
oct | 46354636771 |
9 | 14282778721 |
10 | 5162352121 |
11 | 220a016613 |
12 | 1000a40361 |
13 | 643693b34 |
14 | 36d883933 |
15 | 203325c31 |
hex | 133b33df9 |
5162352121 has 2 divisors, whose sum is σ = 5162352122. Its totient is φ = 5162352120.
The previous prime is 5162352043. The next prime is 5162352197. The reversal of 5162352121 is 1212532615.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5067873721 + 94478400 = 71189^2 + 9720^2 .
It is a cyclic number.
It is not a de Polignac number, because 5162352121 - 211 = 5162350073 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5162352121.
It is not a weakly prime, because it can be changed into another prime (5162352521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2581176060 + 2581176061.
It is an arithmetic number, because the mean of its divisors is an integer number (2581176061).
Almost surely, 25162352121 is an apocalyptic number.
It is an amenable number.
5162352121 is a deficient number, since it is larger than the sum of its proper divisors (1).
5162352121 is an equidigital number, since it uses as much as digits as its factorization.
5162352121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3600, while the sum is 28.
The square root of 5162352121 is about 71849.5102349348. The cubic root of 5162352121 is about 1728.2870457265.
Adding to 5162352121 its reverse (1212532615), we get a palindrome (6374884736).
It can be divided in two parts, 516 and 2352121, that added together give a cube (2352637 = 1333).
The spelling of 5162352121 in words is "five billion, one hundred sixty-two million, three hundred fifty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •