Base | Representation |
---|---|
bin | 1111110010010… |
… | …1101101010100 |
3 | 11121121001112210 |
4 | 3330211231110 |
5 | 113422332430 |
6 | 10323113420 |
7 | 1432546614 |
oct | 374455524 |
9 | 147531483 |
10 | 66214740 |
11 | 34416129 |
12 | 1a212870 |
13 | 10944927 |
14 | 8b18a44 |
15 | 5c2e2b0 |
hex | 3f25b54 |
66214740 has 24 divisors (see below), whose sum is σ = 185401440. Its totient is φ = 17657248.
The previous prime is 66214739. The next prime is 66214741. The reversal of 66214740 is 4741266.
It is an interprime number because it is at equal distance from previous prime (66214739) and next prime (66214741).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 66214698 and 66214707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66214741) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 551730 + ... + 551849.
It is an arithmetic number, because the mean of its divisors is an integer number (7725060).
Almost surely, 266214740 is an apocalyptic number.
66214740 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
66214740 is an abundant number, since it is smaller than the sum of its proper divisors (119186700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66214740 is a wasteful number, since it uses less digits than its factorization.
66214740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1103591 (or 1103589 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 30.
The square root of 66214740 is about 8137.2440051900. The cubic root of 66214740 is about 404.5618184227.
The spelling of 66214740 in words is "sixty-six million, two hundred fourteen thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •