Base | Representation |
---|---|
bin | 1111101111110… |
… | …0011001010101 |
3 | 11121021110102120 |
4 | 3323330121111 |
5 | 113401424100 |
6 | 10315330153 |
7 | 1431243360 |
oct | 373743125 |
9 | 147243376 |
10 | 66045525 |
11 | 3430aa87 |
12 | 1a150959 |
13 | 108b58c0 |
14 | 8ab30d7 |
15 | 5be90a0 |
hex | 3efc655 |
66045525 has 48 divisors (see below), whose sum is σ = 134408064. Its totient is φ = 27866880.
The previous prime is 66045521. The next prime is 66045533. The reversal of 66045525 is 52554066.
It is a happy number.
It is not a de Polignac number, because 66045525 - 22 = 66045521 is a prime.
It is a super-2 number, since 2×660455252 = 8724022745051250, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66045521) 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 in 47 ways as a sum of consecutive naturals, for example, 1987 + ... + 11663.
It is an arithmetic number, because the mean of its divisors is an integer number (2800168).
Almost surely, 266045525 is an apocalyptic number.
66045525 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
66045525 is an abundant number, since it is smaller than the sum of its proper divisors (68362539).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66045525 is a wasteful number, since it uses less digits than its factorization.
66045525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9710 (or 9705 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 33.
The square root of 66045525 is about 8126.8397917026. The cubic root of 66045525 is about 404.2168986113.
The spelling of 66045525 in words is "sixty-six million, forty-five thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •