Base | Representation |
---|---|
bin | 101110100111100100… |
… | …1011001001010001011 |
3 | 100120101222121010120001 |
4 | 1131033021121022023 |
5 | 3120012200011334 |
6 | 113554005543431 |
7 | 10142604616312 |
oct | 1351711311213 |
9 | 316358533501 |
10 | 100112110219 |
11 | 39503749180 |
12 | 1749b414b77 |
13 | 9595b03454 |
14 | 4bb9cc5279 |
15 | 290ded2714 |
hex | 174f25928b |
100112110219 has 8 divisors (see below), whose sum is σ = 110440326960. Its totient is φ = 89988412800.
The previous prime is 100112110213. The next prime is 100112110229. The reversal of 100112110219 is 912011211001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100112110219 - 217 = 100111979147 is a prime.
It is a super-3 number, since 3×1001121102193 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100112110196 and 100112110205.
It is not an unprimeable number, because it can be changed into a prime (100112110213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51128802 + ... + 51130759.
It is an arithmetic number, because the mean of its divisors is an integer number (13805040870).
Almost surely, 2100112110219 is an apocalyptic number.
100112110219 is a deficient number, since it is larger than the sum of its proper divisors (10328216741).
100112110219 is a wasteful number, since it uses less digits than its factorization.
100112110219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102259661.
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 100112110219 in words is "one hundred billion, one hundred twelve million, one hundred ten thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •