Base | Representation |
---|---|
bin | 1111110011111… |
… | …1010101111100 |
3 | 11121210101120200 |
4 | 3330333111330 |
5 | 113434212430 |
6 | 10325243500 |
7 | 1433465004 |
oct | 374772574 |
9 | 147711520 |
10 | 66319740 |
11 | 34488003 |
12 | 1a263590 |
13 | 10980666 |
14 | 8b45004 |
15 | 5c50460 |
hex | 3f3f57c |
66319740 has 36 divisors (see below), whose sum is σ = 201170424. Its totient is φ = 17685216.
The previous prime is 66319727. The next prime is 66319753. The reversal of 66319740 is 4791366.
It is an interprime number because it is at equal distance from previous prime (66319727) and next prime (66319753).
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 66319695 and 66319704.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 184042 + ... + 184401.
Almost surely, 266319740 is an apocalyptic number.
66319740 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
66319740 is an abundant number, since it is smaller than the sum of its proper divisors (134850684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66319740 is a wasteful number, since it uses less digits than its factorization.
66319740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368458 (or 368453 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 36.
The square root of 66319740 is about 8143.6932653434. The cubic root of 66319740 is about 404.7755500733.
The spelling of 66319740 in words is "sixty-six million, three hundred nineteen thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •