Base | Representation |
---|---|
bin | 1111111000001… |
… | …0100101010000 |
3 | 11122022101101010 |
4 | 3332002211100 |
5 | 114022021102 |
6 | 10335210520 |
7 | 1436022651 |
oct | 376024520 |
9 | 148271333 |
10 | 66595152 |
11 | 34655a18 |
12 | 1a376a40 |
13 | 10a48b20 |
14 | 8bb7528 |
15 | 5ca6d6c |
hex | 3f82950 |
66595152 has 160 divisors (see below), whose sum is σ = 201237120. Its totient is φ = 18800640.
The previous prime is 66595147. The next prime is 66595181. The reversal of 66595152 is 25159566.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 66595152.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 486028 + ... + 486164.
It is an arithmetic number, because the mean of its divisors is an integer number (1257732).
Almost surely, 266595152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66595152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100618560).
66595152 is an abundant number, since it is smaller than the sum of its proper divisors (134641968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66595152 is a wasteful number, since it uses less digits than its factorization.
66595152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221 (or 215 counting only the distinct ones).
The product of its digits is 81000, while the sum is 39.
The square root of 66595152 is about 8160.5852731284. The cubic root of 66595152 is about 405.3350922804.
It can be divided in two parts, 6659 and 5152, that added together give a palindrome (11811).
The spelling of 66595152 in words is "sixty-six million, five hundred ninety-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •