Base | Representation |
---|---|
bin | 1111101111110… |
… | …1111111000000 |
3 | 11121021210100120 |
4 | 3323331333000 |
5 | 113402131112 |
6 | 10315420240 |
7 | 1431301344 |
oct | 373757700 |
9 | 147253316 |
10 | 66052032 |
11 | 34314962 |
12 | 1a154680 |
13 | 108b8857 |
14 | 8ab5624 |
15 | 5beae8c |
hex | 3efdfc0 |
66052032 has 28 divisors (see below), whose sum is σ = 174763176. Its totient is φ = 22017280.
The previous prime is 66052031. The next prime is 66052033. The reversal of 66052032 is 23025066.
It is an interprime number because it is at equal distance from previous prime (66052031) and next prime (66052033).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 66051993 and 66052011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66052031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 171819 + ... + 172202.
It is an arithmetic number, because the mean of its divisors is an integer number (6241542).
Almost surely, 266052032 is an apocalyptic number.
It is an amenable number.
66052032 is an abundant number, since it is smaller than the sum of its proper divisors (108711144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66052032 is a wasteful number, since it uses less digits than its factorization.
66052032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 344036 (or 344026 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 66052032 is about 8127.2401219602. The cubic root of 66052032 is about 404.2301730559.
Adding to 66052032 its reverse (23025066), we get a palindrome (89077098).
The spelling of 66052032 in words is "sixty-six million, fifty-two thousand, thirty-two", and thus it is an eban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •