Base | Representation |
---|---|
bin | 1100101000110… |
… | …01010111111110 |
3 | 21101110212112101 |
4 | 12110121113332 |
5 | 204114310420 |
6 | 14304055314 |
7 | 2425033243 |
oct | 624312776 |
9 | 241425471 |
10 | 106010110 |
11 | 54926a68 |
12 | 2b60453a |
13 | 18c6929b |
14 | 101175ca |
15 | 949060a |
hex | 65195fe |
106010110 has 8 divisors (see below), whose sum is σ = 190818216. Its totient is φ = 42404040.
The previous prime is 106010081. The next prime is 106010117. The reversal of 106010110 is 11010601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1060101102 = 22476286844424200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 10601011 = 106010110 / (1 + 0 + 6 + 0 + 1 + 0 + 1 + 1 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106010117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5300496 + ... + 5300515.
It is an arithmetic number, because the mean of its divisors is an integer number (23852277).
Almost surely, 2106010110 is an apocalyptic number.
106010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106010110 is a deficient number, since it is larger than the sum of its proper divisors (84808106).
106010110 is a wasteful number, since it uses less digits than its factorization.
106010110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10601018.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 106010110 is about 10296.1211142838. The cubic root of 106010110 is about 473.2773948089.
Adding to 106010110 its reverse (11010601), we get a palindrome (117020711).
The spelling of 106010110 in words is "one hundred six million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •