Base | Representation |
---|---|
bin | 1111110001011… |
… | …0011011011000 |
3 | 11121110212200201 |
4 | 3330112123120 |
5 | 113413332102 |
6 | 10321511544 |
7 | 1432166263 |
oct | 374263330 |
9 | 147425621 |
10 | 66152152 |
11 | 34383100 |
12 | 1a1a25b4 |
13 | 109222b1 |
14 | 8addcda |
15 | 5c1a987 |
hex | 3f166d8 |
66152152 has 48 divisors (see below), whose sum is σ = 140096880. Its totient is φ = 29240640.
The previous prime is 66152111. The next prime is 66152153. The reversal of 66152152 is 25125166.
It is a super-2 number, since 2×661521522 = 8752214428462208, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 66152152.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66152153) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 34893 + ... + 36739.
It is an arithmetic number, because the mean of its divisors is an integer number (2918685).
Almost surely, 266152152 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 66152152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70048440).
66152152 is an abundant number, since it is smaller than the sum of its proper divisors (73944728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66152152 is a wasteful number, since it uses less digits than its factorization.
66152152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1912 (or 1897 counting only the distinct ones).
The product of its digits is 3600, while the sum is 28.
The square root of 66152152 is about 8133.3973221527. The cubic root of 66152152 is about 404.4343105736.
The spelling of 66152152 in words is "sixty-six million, one hundred fifty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •