Base | Representation |
---|---|
bin | 1111110010110… |
… | …1000110001000 |
3 | 11121122121001112 |
4 | 3330231012020 |
5 | 113424320000 |
6 | 10323505452 |
7 | 1433034053 |
oct | 374550610 |
9 | 147577045 |
10 | 66245000 |
11 | 34436938 |
12 | 1a228288 |
13 | 10955633 |
14 | 8b25a9a |
15 | 5c38235 |
hex | 3f2d188 |
66245000 has 40 divisors (see below), whose sum is σ = 155223750. Its totient is φ = 26496000.
The previous prime is 66244999. The next prime is 66245009. The reversal of 66245000 is 54266.
66245000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 5 ways, for example, as 17956 + 66227044 = 134^2 + 8138^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66245009) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 1625 + ... + 11624.
Almost surely, 266245000 is an apocalyptic number.
It is an amenable number.
66245000 is an abundant number, since it is smaller than the sum of its proper divisors (88978750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66245000 is a wasteful number, since it uses less digits than its factorization.
66245000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13275 (or 13256 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 66245000 is about 8139.1031446960. The cubic root of 66245000 is about 404.6234370102.
Adding to 66245000 its reverse (54266), we get a palindrome (66299266).
The spelling of 66245000 in words is "sixty-six million, two hundred forty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •