Base | Representation |
---|---|
bin | 110001011001001010… |
… | …1001011010011110100 |
3 | 101010210021111201201222 |
4 | 1202302111023103310 |
5 | 3214213201022100 |
6 | 120421200005512 |
7 | 10443353365166 |
oct | 1426225132364 |
9 | 333707451658 |
10 | 106071110900 |
11 | 40a91416627 |
12 | 18683000898 |
13 | a005545861 |
14 | 51c34a0936 |
15 | 2b5c21c485 |
hex | 18b254b4f4 |
106071110900 has 36 divisors (see below), whose sum is σ = 230599889100. Its totient is φ = 42349996800.
The previous prime is 106071110843. The next prime is 106071110911. The reversal of 106071110900 is 9011170601.
It can be written as a sum of positive squares in 6 ways, for example, as 27035909476 + 79035201424 = 164426^2 + 281132^2 .
It is a super-2 number, since 2×1060711109002 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106071110900.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 926225 + ... + 1034424.
It is an arithmetic number, because the mean of its divisors is an integer number (6405552475).
Almost surely, 2106071110900 is an apocalyptic number.
106071110900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106071110900 is an abundant number, since it is smaller than the sum of its proper divisors (124528778200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106071110900 is a wasteful number, since it uses less digits than its factorization.
106071110900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1961204 (or 1961197 counting only the distinct ones).
The product of its (nonzero) digits is 378, while the sum is 26.
The spelling of 106071110900 in words is "one hundred six billion, seventy-one million, one hundred ten thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •