Base | Representation |
---|---|
bin | 1001011010001000… |
… | …00011100011001001 |
3 | 111001000100122110001 |
4 | 10231010003203021 |
5 | 40321024131004 |
6 | 2153112323001 |
7 | 236111556322 |
oct | 45504034311 |
9 | 14030318401 |
10 | 5051005129 |
11 | 2162184a05 |
12 | b8b6a3461 |
13 | 6265a9641 |
14 | 35cb7b449 |
15 | 1e867e1a4 |
hex | 12d1038c9 |
5051005129 has 2 divisors, whose sum is σ = 5051005130. Its totient is φ = 5051005128.
The previous prime is 5051005097. The next prime is 5051005147. The reversal of 5051005129 is 9215001505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5037166729 + 13838400 = 70973^2 + 3720^2 .
It is a cyclic number.
It is not a de Polignac number, because 5051005129 - 25 = 5051005097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5051005097 and 5051005106.
It is not a weakly prime, because it can be changed into another prime (5051003129) 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 as a sum of consecutive naturals, namely, 2525502564 + 2525502565.
It is an arithmetic number, because the mean of its divisors is an integer number (2525502565).
Almost surely, 25051005129 is an apocalyptic number.
It is an amenable number.
5051005129 is a deficient number, since it is larger than the sum of its proper divisors (1).
5051005129 is an equidigital number, since it uses as much as digits as its factorization.
5051005129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2250, while the sum is 28.
The square root of 5051005129 is about 71070.4237288621. The cubic root of 5051005129 is about 1715.7707895874.
The spelling of 5051005129 in words is "five billion, fifty-one million, five thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •