Base | Representation |
---|---|
bin | 10110101111001100011101… |
… | …000111101111000111010011 |
3 | 111010001221000201110100020201 |
4 | 112233030131013233013103 |
5 | 101101400413300320034 |
6 | 552403244021120031 |
7 | 30030530323136041 |
oct | 2657143507570723 |
9 | 433057021410221 |
10 | 100000212120019 |
11 | 29954940818082 |
12 | b270864859017 |
13 | 43a4c97084a53 |
14 | 1a9a07106b391 |
15 | b8637d220014 |
hex | 5af31d1ef1d3 |
100000212120019 has 4 divisors (see below), whose sum is σ = 100116898482744. Its totient is φ = 99883525757296.
The previous prime is 100000212119989. The next prime is 100000212120043. The reversal of 100000212120019 is 910021212000001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100000212120019 - 217 = 100000211988947 is a prime.
It is a super-2 number, since 2×1000002121200192 (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 = 100000212119978 and 100000212120005.
It is not an unprimeable number, because it can be changed into a prime (100004212120019) 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, 58343180077 + ... + 58343181790.
It is an arithmetic number, because the mean of its divisors is an integer number (25029224620686).
Almost surely, 2100000212120019 is an apocalyptic number.
100000212120019 is a deficient number, since it is larger than the sum of its proper divisors (116686362725).
100000212120019 is an equidigital number, since it uses as much as digits as its factorization.
100000212120019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116686362724.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 100000212120019 in words is "one hundred trillion, two hundred twelve million, one hundred twenty thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •