Base | Representation |
---|---|
bin | 1001101001010110011110… |
… | …0001100110101001110110 |
3 | 1101112220222011001122111002 |
4 | 2122111213201212221312 |
5 | 2342232102321204100 |
6 | 34320200110243302 |
7 | 2143154562006302 |
oct | 232254741465166 |
9 | 41486864048432 |
10 | 10606011116150 |
11 | 3419a908600aa |
12 | 12336237b6532 |
13 | 5bc1b1274398 |
14 | 289495876d02 |
15 | 135d478922d5 |
hex | 9a567866a76 |
10606011116150 has 24 divisors (see below), whose sum is σ = 19734409651320. Its totient is φ = 4240849828160.
The previous prime is 10606011116143. The next prime is 10606011116227. The reversal of 10606011116150 is 5161111060601.
It is a happy number.
It is a super-2 number, since 2×106060111161502 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 38727644 + ... + 39000543.
It is an arithmetic number, because the mean of its divisors is an integer number (822267068805).
Almost surely, 210606011116150 is an apocalyptic number.
10606011116150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10606011116150 is a deficient number, since it is larger than the sum of its proper divisors (9128398535170).
10606011116150 is a wasteful number, since it uses less digits than its factorization.
10606011116150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77730928 (or 77730923 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 29.
Adding to 10606011116150 its reverse (5161111060601), we get a palindrome (15767122176751).
The spelling of 10606011116150 in words is "ten trillion, six hundred six billion, eleven million, one hundred sixteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •