Base | Representation |
---|---|
bin | 10110101111010111011100… |
… | …011001101001111001110111 |
3 | 111010010001111000111201022101 |
4 | 112233113130121221321313 |
5 | 101102044044331400434 |
6 | 552412514512242531 |
7 | 30031425604514344 |
oct | 2657273431517167 |
9 | 433101430451271 |
10 | 100012011200119 |
11 | 29959946018647 |
12 | b272bb8240447 |
13 | 43a61276cc655 |
14 | 1a9a8701077cb |
15 | b8681e003b14 |
hex | 5af5dc669e77 |
100012011200119 has 4 divisors (see below), whose sum is σ = 100012032628096. Its totient is φ = 100011989772144.
The previous prime is 100012011200089. The next prime is 100012011200161. The reversal of 100012011200119 is 911002110210001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100012011200119 is a prime.
It is a super-2 number, since 2×1000120112001192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100012011200096 and 100012011200105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100012011200419) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 409239 + ... + 14148904.
It is an arithmetic number, because the mean of its divisors is an integer number (25003008157024).
Almost surely, 2100012011200119 is an apocalyptic number.
100012011200119 is a deficient number, since it is larger than the sum of its proper divisors (21427977).
100012011200119 is an equidigital number, since it uses as much as digits as its factorization.
100012011200119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21427976.
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 100012011200119 in words is "one hundred trillion, twelve billion, eleven million, two hundred thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •