Base | Representation |
---|---|
bin | 1111110011000… |
… | …1100000100000 |
3 | 11121200111211212 |
4 | 3330301200200 |
5 | 113430404242 |
6 | 10324125252 |
7 | 1433140541 |
oct | 374614040 |
9 | 147614755 |
10 | 66263072 |
11 | 34449477 |
12 | 1a236828 |
13 | 10960925 |
14 | 8b2c4c8 |
15 | 5c3d782 |
hex | 3f31820 |
66263072 has 18 divisors (see below), whose sum is σ = 130546143. Its totient is φ = 33108512.
The previous prime is 66263063. The next prime is 66263083. The reversal of 66263072 is 27036266.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 33131536 + 33131536 = 5756^2 + 5756^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=5756.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 45329 + ... + 46767.
Almost surely, 266263072 is an apocalyptic number.
It is an amenable number.
66263072 is a deficient number, since it is larger than the sum of its proper divisors (64283071).
66263072 is an frugal number, since it uses more digits than its factorization.
66263072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2888 (or 1441 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 32.
The square root of 66263072 is about 8140.2132650195. The cubic root of 66263072 is about 404.6602281637.
Multiplying 66263072 by its sum of digits (32), we get a square (2120418304 = 460482).
66263072 divided by its sum of digits (32) gives a square (2070721 = 14392).
The spelling of 66263072 in words is "sixty-six million, two hundred sixty-three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •