Base | Representation |
---|---|
bin | 1111110111101… |
… | …0110100101010 |
3 | 11122020202210000 |
4 | 3331322310222 |
5 | 114020011440 |
6 | 10334403430 |
7 | 1435531206 |
oct | 375726452 |
9 | 148222700 |
10 | 66563370 |
11 | 34634055 |
12 | 1a360576 |
13 | 10a37513 |
14 | 8ba9b06 |
15 | 5c9c730 |
hex | 3f7ad2a |
66563370 has 80 divisors (see below), whose sum is σ = 183901608. Its totient is φ = 17262720.
The previous prime is 66563369. The next prime is 66563401. The reversal of 66563370 is 7336566.
66563370 is a `hidden beast` number, since 66 + 563 + 37 + 0 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 65173329 + 1390041 = 8073^2 + 1179^2 .
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 28860 + ... + 31080.
Almost surely, 266563370 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66563370, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91950804).
66563370 is an abundant number, since it is smaller than the sum of its proper divisors (117338238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66563370 is a wasteful number, since it uses less digits than its factorization.
66563370 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2277 (or 2268 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 36.
The square root of 66563370 is about 8158.6377539391. The cubic root of 66563370 is about 405.2706010504.
The spelling of 66563370 in words is "sixty-six million, five hundred sixty-three thousand, three hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •