Base | Representation |
---|---|
bin | 1011110001010000111… |
… | …1101100000110000001 |
3 | 201022220212211202222111 |
4 | 2330110033230012001 |
5 | 11303102444320001 |
6 | 232520230335321 |
7 | 20415532106251 |
oct | 2742417540601 |
9 | 638825752874 |
10 | 202203120001 |
11 | 78832431933 |
12 | 332314ba541 |
13 | 160b58a398c |
14 | 9b02931961 |
15 | 53d6aaa851 |
hex | 2f143ec181 |
202203120001 has 8 divisors (see below), whose sum is σ = 203493576960. Its totient is φ = 200916367008.
The previous prime is 202203119999. The next prime is 202203120013. The reversal of 202203120001 is 100021302202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 202203120001 - 21 = 202203119999 is a prime.
It is a super-2 number, since 2×2022031200012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202203120061) 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, 816421 + ... + 1034866.
It is an arithmetic number, because the mean of its divisors is an integer number (25436697120).
Almost surely, 2202203120001 is an apocalyptic number.
It is an amenable number.
202203120001 is a deficient number, since it is larger than the sum of its proper divisors (1290456959).
202203120001 is a wasteful number, since it uses less digits than its factorization.
202203120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1851983.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 202203120001 its reverse (100021302202), we get a palindrome (302224422203).
The spelling of 202203120001 in words is "two hundred two billion, two hundred three million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •