Base | Representation |
---|---|
bin | 1111110010111… |
… | …0001000000011 |
3 | 11121122210211210 |
4 | 3330232020003 |
5 | 113424433334 |
6 | 10323541203 |
7 | 1433052261 |
oct | 374561003 |
9 | 147583753 |
10 | 66249219 |
11 | 3443a023 |
12 | 1a22a803 |
13 | 1095752a |
14 | 8b27431 |
15 | 5c395e9 |
hex | 3f2e203 |
66249219 has 16 divisors (see below), whose sum is σ = 93843200. Its totient is φ = 41453856.
The previous prime is 66249199. The next prime is 66249229. The reversal of 66249219 is 91294266.
66249219 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 66249219 - 27 = 66249091 is a prime.
It is a super-2 number, since 2×662492192 = 8777918036219922, which contains 22 as substring.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (66249229) 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 15 ways as a sum of consecutive naturals, for example, 882 + ... + 11544.
It is an arithmetic number, because the mean of its divisors is an integer number (5865200).
Almost surely, 266249219 is an apocalyptic number.
66249219 is a deficient number, since it is larger than the sum of its proper divisors (27593981).
66249219 is a wasteful number, since it uses less digits than its factorization.
66249219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10794.
The product of its digits is 46656, while the sum is 39.
The square root of 66249219 is about 8139.3623214598. The cubic root of 66249219 is about 404.6320266901.
The spelling of 66249219 in words is "sixty-six million, two hundred forty-nine thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •