Base | Representation |
---|---|
bin | 11101000111000001001… |
… | …00111110011100010001 |
3 | 10112121200200010201222222 |
4 | 32203200210332130101 |
5 | 112341402222431001 |
6 | 2043252521310425 |
7 | 132155615304230 |
oct | 16434044763421 |
9 | 3477620121888 |
10 | 1000200202001 |
11 | 356200a366a0 |
12 | 141a19035415 |
13 | 7341a8c3a70 |
14 | 365a4c7cb17 |
15 | 1b03e11061b |
hex | e8e093e711 |
1000200202001 has 16 divisors (see below), whose sum is σ = 1342926146688. Its totient is φ = 719424720000.
The previous prime is 1000200201989. The next prime is 1000200202021. The reversal of 1000200202001 is 1002020020001.
It is a de Polignac number, because none of the positive numbers 2k-1000200202001 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1000200202001.
It is not an unprimeable number, because it can be changed into a prime (1000200202021) 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 15 ways as a sum of consecutive naturals, for example, 499599500 + ... + 499601501.
It is an arithmetic number, because the mean of its divisors is an integer number (83932884168).
Almost surely, 21000200202001 is an apocalyptic number.
1000200202001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1000200202001 is a deficient number, since it is larger than the sum of its proper divisors (342725944687).
1000200202001 is a wasteful number, since it uses less digits than its factorization.
1000200202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 999201032.
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 1000200202001 its reverse (1002020020001), we get a palindrome (2002220222002).
The spelling of 1000200202001 in words is "one trillion, two hundred million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •