Base | Representation |
---|---|
bin | 111101110110101011… |
… | …100100001000111110 |
3 | 20100102121202010220010 |
4 | 331312223210020332 |
5 | 2042004401004100 |
6 | 50302205404050 |
7 | 4540561430565 |
oct | 756653441076 |
9 | 210377663803 |
10 | 66415641150 |
11 | 26191997231 |
12 | 10a56569626 |
13 | 6355982961 |
14 | 3300978bdc |
15 | 1adaadd750 |
hex | f76ae423e |
66415641150 has 96 divisors (see below), whose sum is σ = 167312291328. Its totient is φ = 17433187200.
The previous prime is 66415641113. The next prime is 66415641199. The reversal of 66415641150 is 5114651466.
It is a happy number.
It is a super-2 number, since 2×664156411502 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 66415641099 and 66415641108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2567280 + ... + 2593020.
It is an arithmetic number, because the mean of its divisors is an integer number (1742836368).
Almost surely, 266415641150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66415641150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83656145664).
66415641150 is an abundant number, since it is smaller than the sum of its proper divisors (100896650178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66415641150 is a wasteful number, since it uses less digits than its factorization.
66415641150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26026 (or 26021 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 39.
The spelling of 66415641150 in words is "sixty-six billion, four hundred fifteen million, six hundred forty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •