Base | Representation |
---|---|
bin | 101101111110101100001001… |
… | …111100011000100111110001 |
3 | 222112000001110022002011120122 |
4 | 231332230021330120213301 |
5 | 203001133242134201001 |
6 | 1554030345331020025 |
7 | 60410630614166333 |
oct | 5576541174304761 |
9 | 875001408064518 |
10 | 202220112022001 |
11 | 59485082407117 |
12 | 1a81b74243a615 |
13 | 88ab3757ac848 |
14 | 37d17116bb453 |
15 | 185a320ed8b1b |
hex | b7eb09f189f1 |
202220112022001 has 4 divisors (see below), whose sum is σ = 202220142314352. Its totient is φ = 202220081729652.
The previous prime is 202220112021947. The next prime is 202220112022013. The reversal of 202220112022001 is 100220211022202.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 202220112022001 - 222 = 202220107827697 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202220112022091) 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, 248015 + ... + 20112228.
It is an arithmetic number, because the mean of its divisors is an integer number (50555035578588).
Almost surely, 2202220112022001 is an apocalyptic number.
It is an amenable number.
202220112022001 is a deficient number, since it is larger than the sum of its proper divisors (30292351).
202220112022001 is an equidigital number, since it uses as much as digits as its factorization.
202220112022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30292350.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 202220112022001 its reverse (100220211022202), we get a palindrome (302440323044203).
The spelling of 202220112022001 in words is "two hundred two trillion, two hundred twenty billion, one hundred twelve million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •