Base | Representation |
---|---|
bin | 110001010111010110… |
… | …0011110101010001000 |
3 | 101010122000201121001121 |
4 | 1202232230132222020 |
5 | 3214102042014400 |
6 | 120411140325024 |
7 | 10442013033562 |
oct | 1425654365210 |
9 | 333560647047 |
10 | 106010110600 |
11 | 40a5aa42159 |
12 | 186666a3774 |
13 | 9cc5a084c4 |
14 | 51b9342332 |
15 | 2b56bbd21a |
hex | 18aeb1ea88 |
106010110600 has 48 divisors (see below), whose sum is σ = 246494937600. Its totient is φ = 42400357440.
The previous prime is 106010110571. The next prime is 106010110607. The reversal of 106010110600 is 6011010601.
It is a super-2 number, since 2×1060101106002 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106010110607) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4403797 + ... + 4427803.
It is an arithmetic number, because the mean of its divisors is an integer number (5135311200).
Almost surely, 2106010110600 is an apocalyptic number.
106010110600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106010110600 is an abundant number, since it is smaller than the sum of its proper divisors (140484827000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106010110600 is a wasteful number, since it uses less digits than its factorization.
106010110600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46102 (or 46093 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Subtracting from 106010110600 its reverse (6011010601), we obtain a palindrome (99999099999).
It can be divided in two parts, 1060101 and 10600, that added together give a palindrome (1070701).
The spelling of 106010110600 in words is "one hundred six billion, ten million, one hundred ten thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •