Base | Representation |
---|---|
bin | 1111110100001… |
… | …1000101000000 |
3 | 11121211011120100 |
4 | 3331003011000 |
5 | 113440210130 |
6 | 10325442400 |
7 | 1433560422 |
oct | 375030500 |
9 | 147734510 |
10 | 66335040 |
11 | 34498552 |
12 | 1a270400 |
13 | 10987605 |
14 | 8b4a812 |
15 | 5c54c60 |
hex | 3f43140 |
66335040 has 168 divisors, whose sum is σ = 235842048. Its totient is φ = 17095680.
The previous prime is 66334997. The next prime is 66335047. The reversal of 66335040 is 4053366.
It is a junction number, because it is equal to n+sod(n) for n = 66334995 and 66335013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66335047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 88909 + ... + 89651.
Almost surely, 266335040 is an apocalyptic number.
66335040 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66335040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117921024).
66335040 is an abundant number, since it is smaller than the sum of its proper divisors (169507008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66335040 is a wasteful number, since it uses less digits than its factorization.
66335040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 797 (or 784 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
The square root of 66335040 is about 8144.6325883983. The cubic root of 66335040 is about 404.8066749929.
The spelling of 66335040 in words is "sixty-six million, three hundred thirty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •