Base | Representation |
---|---|
bin | 1111110110101… |
… | …1111100100001 |
3 | 11122010200012002 |
4 | 3331223330201 |
5 | 114011034213 |
6 | 10333213345 |
7 | 1435155434 |
oct | 375537441 |
9 | 148120162 |
10 | 66502433 |
11 | 345a2298 |
12 | 1a331255 |
13 | 10a1586a |
14 | 8b9181b |
15 | 5c89658 |
hex | 3f6bf21 |
66502433 has 2 divisors, whose sum is σ = 66502434. Its totient is φ = 66502432.
The previous prime is 66502427. The next prime is 66502441. The reversal of 66502433 is 33420566.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 34951744 + 31550689 = 5912^2 + 5617^2 .
It is a cyclic number.
It is not a de Polignac number, because 66502433 - 212 = 66498337 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 66502396 and 66502405.
It is not a weakly prime, because it can be changed into another prime (66502463) 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 as a sum of consecutive naturals, namely, 33251216 + 33251217.
It is an arithmetic number, because the mean of its divisors is an integer number (33251217).
Almost surely, 266502433 is an apocalyptic number.
It is an amenable number.
66502433 is a deficient number, since it is larger than the sum of its proper divisors (1).
66502433 is an equidigital number, since it uses as much as digits as its factorization.
66502433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 29.
The square root of 66502433 is about 8154.9023905869. The cubic root of 66502433 is about 405.1468917960.
Adding to 66502433 its reverse (33420566), we get a palindrome (99922999).
The spelling of 66502433 in words is "sixty-six million, five hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •