Base | Representation |
---|---|
bin | 111101011101111110… |
… | …010000010010000110 |
3 | 20022100201201210021010 |
4 | 331131332100102012 |
5 | 2040132241011100 |
6 | 50153120503050 |
7 | 4524366115443 |
oct | 753576202206 |
9 | 208321653233 |
10 | 66001110150 |
11 | 25a999a6a28 |
12 | 1095b77aa86 |
13 | 62bab24341 |
14 | 32a18b09ca |
15 | 1ab4509750 |
hex | f5df90486 |
66001110150 has 48 divisors (see below), whose sum is σ = 169326997200. Its totient is φ = 16993388160.
The previous prime is 66001110143. The next prime is 66001110151. The reversal of 66001110150 is 5101110066.
It is a super-2 number, since 2×660011101502 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66001110151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7581985 + ... + 7590684.
It is an arithmetic number, because the mean of its divisors is an integer number (3527645775).
Almost surely, 266001110150 is an apocalyptic number.
66001110150 is an abundant number, since it is smaller than the sum of its proper divisors (103325887050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66001110150 is a wasteful number, since it uses less digits than its factorization.
66001110150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15172713 (or 15172708 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 21.
The spelling of 66001110150 in words is "sixty-six billion, one million, one hundred ten thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •