Base | Representation |
---|---|
bin | 11000001000000111100101… |
… | …000011101110000001110010 |
3 | 111220201010001201202122002112 |
4 | 120020013211003232001302 |
5 | 102402010322030130411 |
6 | 1013402420335245322 |
7 | 31231160514135251 |
oct | 3010074503560162 |
9 | 456633051678075 |
10 | 106111010005106 |
11 | 308a04769264a7 |
12 | ba99036679842 |
13 | 47292c1003aa2 |
14 | 1c2bb2bdb8798 |
15 | c402ce35ab8b |
hex | 6081e50ee072 |
106111010005106 has 32 divisors (see below), whose sum is σ = 162851472703920. Its totient is φ = 51840884265984.
The previous prime is 106111010005081. The next prime is 106111010005183. The reversal of 106111010005106 is 601500010111601.
It is a happy number.
106111010005106 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 97750613645881 + 8360396359225 = 9886891^2 + 2891435^2 .
It is a super-2 number, since 2×1061110100051062 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 106653806 + ... + 107644118.
Almost surely, 2106111010005106 is an apocalyptic number.
106111010005106 is a deficient number, since it is larger than the sum of its proper divisors (56740462698814).
106111010005106 is a wasteful number, since it uses less digits than its factorization.
106111010005106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 997230.
The product of its (nonzero) digits is 180, while the sum is 23.
Adding to 106111010005106 its reverse (601500010111601), we get a palindrome (707611020116707).
The spelling of 106111010005106 in words is "one hundred six trillion, one hundred eleven billion, ten million, five thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •