Base | Representation |
---|---|
bin | 1111110011101… |
… | …0101001000000 |
3 | 11121202102011100 |
4 | 3330322221000 |
5 | 113433103410 |
6 | 10325014400 |
7 | 1433354601 |
oct | 374725100 |
9 | 147672140 |
10 | 66300480 |
11 | 34474594 |
12 | 1a254400 |
13 | 1097496c |
14 | 8b3bda8 |
15 | 5c498c0 |
hex | 3f3aa40 |
66300480 has 84 divisors (see below), whose sum is σ = 228055932. Its totient is φ = 17679360.
The previous prime is 66300463. The next prime is 66300497. The reversal of 66300480 is 8400366.
66300480 = T96 + T97 + ... + T735.
66300480 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (66300463) and next prime (66300497).
It can be written as a sum of positive squares in 2 ways, for example, as 15492096 + 50808384 = 3936^2 + 7128^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8631 + ... + 14390.
Almost surely, 266300480 is an apocalyptic number.
66300480 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
66300480 is an abundant number, since it is smaller than the sum of its proper divisors (161755452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66300480 is a wasteful number, since it uses less digits than its factorization.
66300480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23044 (or 23031 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 66300480 is about 8142.5106693206. The cubic root of 66300480 is about 404.7363624855.
The spelling of 66300480 in words is "sixty-six million, three hundred thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •