Base | Representation |
---|---|
bin | 110001011010010100… |
… | …1111011100111000010 |
3 | 101010212222212220000210 |
4 | 1202310221323213002 |
5 | 3214303141343200 |
6 | 120425111454550 |
7 | 10444336006524 |
oct | 1426451734702 |
9 | 333788786023 |
10 | 106110106050 |
11 | 41001430223 |
12 | 18694087456 |
13 | a010649c00 |
14 | 51c8731a14 |
15 | 2b60871650 |
hex | 18b4a7b9c2 |
106110106050 has 72 divisors (see below), whose sum is σ = 284952793104. Its totient is φ = 26119404480.
The previous prime is 106110106019. The next prime is 106110106051. The reversal of 106110106050 is 50601011601.
It is a super-2 number, since 2×1061101060502 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106110106051) 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 35 ways as a sum of consecutive naturals, for example, 2067552 + ... + 2118251.
It is an arithmetic number, because the mean of its divisors is an integer number (3957677682).
Almost surely, 2106110106050 is an apocalyptic number.
106110106050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106110106050 is an abundant number, since it is smaller than the sum of its proper divisors (178842687054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106110106050 is a wasteful number, since it uses less digits than its factorization.
106110106050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4185844 (or 4185826 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 21.
Adding to 106110106050 its reverse (50601011601), we get a palindrome (156711117651).
The spelling of 106110106050 in words is "one hundred six billion, one hundred ten million, one hundred six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •