Base | Representation |
---|---|
bin | 1111111010011… |
… | …0100011100100 |
3 | 11122120212111110 |
4 | 3332212203210 |
5 | 114041230000 |
6 | 10342305020 |
7 | 1440205356 |
oct | 376464344 |
9 | 148525443 |
10 | 66742500 |
11 | 347466a0 |
12 | 1a428170 |
13 | 10a9ac06 |
14 | 8c150d6 |
15 | 5cd5850 |
hex | 3fa68e4 |
66742500 has 120 divisors (see below), whose sum is σ = 212556960. Its totient is φ = 16160000.
The previous prime is 66742471. The next prime is 66742523. The reversal of 66742500 is 524766.
It is a super-2 number, since 2×667425002 = 8909122612500000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 82096 + ... + 82904.
It is an arithmetic number, because the mean of its divisors is an integer number (1771308).
Almost surely, 266742500 is an apocalyptic number.
66742500 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 66742500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106278480).
66742500 is an abundant number, since it is smaller than the sum of its proper divisors (145814460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66742500 is a wasteful number, since it uses less digits than its factorization.
66742500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 847 (or 830 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 30.
The square root of 66742500 is about 8169.6083137443. The cubic root of 66742500 is about 405.6338193307.
The spelling of 66742500 in words is "sixty-six million, seven hundred forty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.269 sec. • engine limits •