Base | Representation |
---|---|
bin | 1001000110001000110100… |
… | …00100111100011010011111 |
3 | 2121211011220202100202222101 |
4 | 10203010122010330122133 |
5 | 10110203300122413434 |
6 | 110312501000425531 |
7 | 4133050455314131 |
oct | 443043204743237 |
9 | 77734822322871 |
10 | 20002100201119 |
11 | 6411930123243 |
12 | 22b065aa782a7 |
13 | b212614422aa |
14 | 4d216d15b051 |
15 | 24a47943cb14 |
hex | 12311a13c69f |
20002100201119 has 4 divisors (see below), whose sum is σ = 20018866422096. Its totient is φ = 19985333980144.
The previous prime is 20002100201107. The next prime is 20002100201129. The reversal of 20002100201119 is 91110200120002.
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 20002100201119 - 213 = 20002100192927 is a prime.
It is a super-2 number, since 2×200021002011192 (a number of 27 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 = 20002100201096 and 20002100201105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002100201129) 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, 8383108699 + ... + 8383111084.
It is an arithmetic number, because the mean of its divisors is an integer number (5004716605524).
Almost surely, 220002100201119 is an apocalyptic number.
20002100201119 is a deficient number, since it is larger than the sum of its proper divisors (16766220977).
20002100201119 is a wasteful number, since it uses less digits than its factorization.
20002100201119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16766220976.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 20002100201119 in words is "twenty trillion, two billion, one hundred million, two hundred one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •