Base | Representation |
---|---|
bin | 101110100100110101… |
… | …0000110101100000011 |
3 | 100120011120022120021222 |
4 | 1131021222012230003 |
5 | 3114320111201034 |
6 | 113540520105255 |
7 | 10140406105511 |
oct | 1351152065403 |
9 | 316146276258 |
10 | 100020022019 |
11 | 39466770a25 |
12 | 1747460522b |
13 | 957c9ccba8 |
14 | 4bab9934b1 |
15 | 2905d9212e |
hex | 1749a86b03 |
100020022019 has 8 divisors (see below), whose sum is σ = 105947740800. Its totient is φ = 94097213056.
The previous prime is 100020022001. The next prime is 100020022079. The reversal of 100020022019 is 910220020001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100020022019 is a prime.
It is a super-2 number, since 2×1000200220192 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100020021988 and 100020022006.
It is not an unprimeable number, because it can be changed into a prime (100020022079) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1185464 + ... + 1267029.
It is an arithmetic number, because the mean of its divisors is an integer number (13243467600).
Almost surely, 2100020022019 is an apocalyptic number.
100020022019 is a deficient number, since it is larger than the sum of its proper divisors (5927718781).
100020022019 is a wasteful number, since it uses less digits than its factorization.
100020022019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2454909.
The product of its (nonzero) digits is 72, while the sum is 17.
The spelling of 100020022019 in words is "one hundred billion, twenty million, twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •