Base | Representation |
---|---|
bin | 11110000101010010101010… |
… | …11101110010100001001011 |
3 | 22200020010012212112020211011 |
4 | 33002221111131302201023 |
5 | 32132320330130243301 |
6 | 352410014225544351 |
7 | 16635235055445166 |
oct | 1702512535624113 |
9 | 280203185466734 |
10 | 66152520165451 |
11 | 1a09514304a275 |
12 | 75049751a50b7 |
13 | 2abb20462a6a5 |
14 | 1249b28896add |
15 | 79aba39caa51 |
hex | 3c2a5577284b |
66152520165451 has 2 divisors, whose sum is σ = 66152520165452. Its totient is φ = 66152520165450.
The previous prime is 66152520165427. The next prime is 66152520165533. The reversal of 66152520165451 is 15456102525166.
66152520165451 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 66152520165451 - 217 = 66152520034379 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 66152520165395 and 66152520165404.
It is not a weakly prime, because it can be changed into another prime (66152520160451) 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, 33076260082725 + 33076260082726.
It is an arithmetic number, because the mean of its divisors is an integer number (33076260082726).
Almost surely, 266152520165451 is an apocalyptic number.
66152520165451 is a deficient number, since it is larger than the sum of its proper divisors (1).
66152520165451 is an equidigital number, since it uses as much as digits as its factorization.
66152520165451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160000, while the sum is 49.
The spelling of 66152520165451 in words is "sixty-six trillion, one hundred fifty-two billion, five hundred twenty million, one hundred sixty-five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •