Base | Representation |
---|---|
bin | 1111101111110… |
… | …1101110001000 |
3 | 11121021201212120 |
4 | 3323331232020 |
5 | 113402112302 |
6 | 10315411240 |
7 | 1431265242 |
oct | 373755610 |
9 | 147251776 |
10 | 66050952 |
11 | 34314070 |
12 | 1a153b20 |
13 | 108b8206 |
14 | 8ab5092 |
15 | 5bea9bc |
hex | 3efdb88 |
66050952 has 64 divisors (see below), whose sum is σ = 182476800. Its totient is φ = 19755840.
The previous prime is 66050947. The next prime is 66050953. The reversal of 66050952 is 25905066.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (66050953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19273 + ... + 22439.
It is an arithmetic number, because the mean of its divisors is an integer number (2851200).
Almost surely, 266050952 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 66050952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91238400).
66050952 is an abundant number, since it is smaller than the sum of its proper divisors (116425848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66050952 is a wasteful number, since it uses less digits than its factorization.
66050952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3266 (or 3262 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 33.
The square root of 66050952 is about 8127.1736784690. The cubic root of 66050952 is about 404.2279698890.
The spelling of 66050952 in words is "sixty-six million, fifty thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •