Base | Representation |
---|---|
bin | 110010100000000000101101… |
… | …100011001111000011111001 |
3 | 1002010101202101010121101222110 |
4 | 302200000231203033003321 |
5 | 213102410111413202301 |
6 | 2104212145133042533 |
7 | 64532230260244536 |
oct | 6240005543170371 |
9 | 1063352333541873 |
10 | 222102113022201 |
11 | 6484aa8267a105 |
12 | 20ab0a64326449 |
13 | 96c11a73138b9 |
14 | 3cbbb2a26bd8d |
15 | 1aa25bb8c80d6 |
hex | ca002d8cf0f9 |
222102113022201 has 4 divisors (see below), whose sum is σ = 296136150696272. Its totient is φ = 148068075348132.
The previous prime is 222102113022091. The next prime is 222102113022241. The reversal of 222102113022201 is 102220311201222.
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 not a de Polignac number, because 222102113022201 - 242 = 217704066511097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222102113022241) 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, 37017018837031 + ... + 37017018837036.
It is an arithmetic number, because the mean of its divisors is an integer number (74034037674068).
Almost surely, 2222102113022201 is an apocalyptic number.
It is an amenable number.
222102113022201 is a deficient number, since it is larger than the sum of its proper divisors (74034037674071).
222102113022201 is an equidigital number, since it uses as much as digits as its factorization.
222102113022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74034037674070.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 222102113022201 its reverse (102220311201222), we get a palindrome (324322424223423).
The spelling of 222102113022201 in words is "two hundred twenty-two trillion, one hundred two billion, one hundred thirteen million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •