Base | Representation |
---|---|
bin | 1111101111101… |
… | …1010010111110 |
3 | 11121021020020210 |
4 | 3323323102332 |
5 | 113401303042 |
6 | 10315253250 |
7 | 1431224265 |
oct | 373732276 |
9 | 147236223 |
10 | 66041022 |
11 | 34307663 |
12 | 1a14a226 |
13 | 108b3838 |
14 | 8ab15dc |
15 | 5be7a9c |
hex | 3efb4be |
66041022 has 32 divisors (see below), whose sum is σ = 140216832. Its totient is φ = 20664704.
The previous prime is 66041009. The next prime is 66041023. The reversal of 66041022 is 22014066.
It is a happy number.
It is a super-2 number, since 2×660410222 = 8722833173608968, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 66041022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66041023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59323 + ... + 60425.
It is an arithmetic number, because the mean of its divisors is an integer number (4381776).
Almost surely, 266041022 is an apocalyptic number.
66041022 is an abundant number, since it is smaller than the sum of its proper divisors (74175810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66041022 is a wasteful number, since it uses less digits than its factorization.
66041022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1712.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 66041022 is about 8126.5627420208. The cubic root of 66041022 is about 404.2077118670.
Adding to 66041022 its reverse (22014066), we get a palindrome (88055088).
It can be divided in two parts, 6604 and 1022, that added together give a triangular number (7626 = T123).
The spelling of 66041022 in words is "sixty-six million, forty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •