Base | Representation |
---|---|
bin | 110001010111001100… |
… | …1000001101010011100 |
3 | 101010121200010111212020 |
4 | 1202232121001222130 |
5 | 3214044240323400 |
6 | 120410435140140 |
7 | 10441621504332 |
oct | 1425631015234 |
9 | 333550114766 |
10 | 106005011100 |
11 | 40a5807989a |
12 | 18664a44650 |
13 | 9cc4941351 |
14 | 51b87b5b52 |
15 | 2b565122a0 |
hex | 18ae641a9c |
106005011100 has 72 divisors (see below), whose sum is σ = 314997265968. Its totient is φ = 27504000000.
The previous prime is 106005011093. The next prime is 106005011183. The reversal of 106005011100 is 1110500601.
It is a super-2 number, since 2×1060050111002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 106005011100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4763901 + ... + 4786100.
Almost surely, 2106005011100 is an apocalyptic number.
106005011100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106005011100 is an abundant number, since it is smaller than the sum of its proper divisors (208992254868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106005011100 is a wasteful number, since it uses less digits than its factorization.
106005011100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9550055 (or 9550048 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 15.
Adding to 106005011100 its reverse (1110500601), we get a palindrome (107115511701).
The spelling of 106005011100 in words is "one hundred six billion, five million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •