Base | Representation |
---|---|
bin | 110001101001010001… |
… | …0101000111101000110 |
3 | 101012011221100220110120 |
4 | 1203102202220331012 |
5 | 3221320021323420 |
6 | 120550542402410 |
7 | 10462634615046 |
oct | 1432242507506 |
9 | 335157326416 |
10 | 106611511110 |
11 | 41239467275 |
12 | 187b3b90406 |
13 | a0904a46b0 |
14 | 5235171726 |
15 | 2b8e8b5d40 |
hex | 18d28a8f46 |
106611511110 has 64 divisors (see below), whose sum is σ = 276566814720. Its totient is φ = 26145970560.
The previous prime is 106611511073. The next prime is 106611511117. The reversal of 106611511110 is 11115116601.
It is a super-2 number, since 2×1066115111102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106611511117) 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 31 ways as a sum of consecutive naturals, for example, 398670 + ... + 610049.
It is an arithmetic number, because the mean of its divisors is an integer number (4321356480).
Almost surely, 2106611511110 is an apocalyptic number.
106611511110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106611511110 is an abundant number, since it is smaller than the sum of its proper divisors (169955303610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106611511110 is a wasteful number, since it uses less digits than its factorization.
106611511110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009013.
The product of its (nonzero) digits is 180, while the sum is 24.
Adding to 106611511110 its reverse (11115116601), we get a palindrome (117726627711).
The spelling of 106611511110 in words is "one hundred six billion, six hundred eleven million, five hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •