Base | Representation |
---|---|
bin | 101110100100010000… |
… | …1111101110001001000 |
3 | 100120010020201210102000 |
4 | 1131020201331301020 |
5 | 3114300241023422 |
6 | 113535002511000 |
7 | 10140056263620 |
oct | 1351041756110 |
9 | 316106653360 |
10 | 100001111112 |
11 | 39457024981 |
12 | 1746a205460 |
13 | 9578b0b3c6 |
14 | 4ba926d880 |
15 | 29043a8cac |
hex | 174887dc48 |
100001111112 has 128 divisors (see below), whose sum is σ = 321289113600. Its totient is φ = 28227472704.
The previous prime is 100001111057. The next prime is 100001111129. The reversal of 100001111112 is 211111100001.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100001111094 and 100001111103.
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 31 ways as a sum of consecutive naturals, for example, 272928 + ... + 523919.
It is an arithmetic number, because the mean of its divisors is an integer number (2510071200).
Almost surely, 2100001111112 is an apocalyptic number.
100001111112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100001111112 is an abundant number, since it is smaller than the sum of its proper divisors (221288002488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100001111112 is a wasteful number, since it uses less digits than its factorization.
100001111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 796952 (or 796942 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100001111112 its reverse (211111100001), we get a palindrome (311112211113).
The spelling of 100001111112 in words is "one hundred billion, one million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •