Base | Representation |
---|---|
bin | 110000011111011001… |
… | …110011010101111111 |
3 | 11222101121020110220012 |
4 | 300133121303111333 |
5 | 1323113003341101 |
6 | 35530301013435 |
7 | 3522153436331 |
oct | 603731632577 |
9 | 158347213805 |
10 | 52066465151 |
11 | 20099186998 |
12 | a110b5427b |
13 | 4ba9c1897c |
14 | 273cd6b451 |
15 | 154aed5bbb |
hex | c1f67357f |
52066465151 has 2 divisors, whose sum is σ = 52066465152. Its totient is φ = 52066465150.
The previous prime is 52066465133. The next prime is 52066465189. The reversal of 52066465151 is 15156466025.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 52066465151 - 234 = 34886595967 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 52066465099 and 52066465108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52066465651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26033232575 + 26033232576.
It is an arithmetic number, because the mean of its divisors is an integer number (26033232576).
Almost surely, 252066465151 is an apocalyptic number.
52066465151 is a deficient number, since it is larger than the sum of its proper divisors (1).
52066465151 is an equidigital number, since it uses as much as digits as its factorization.
52066465151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216000, while the sum is 41.
The spelling of 52066465151 in words is "fifty-two billion, sixty-six million, four hundred sixty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •