Base | Representation |
---|---|
bin | 110010011111111110110000… |
… | …111011011000011011000001 |
3 | 1002010101112222102100122010012 |
4 | 302133332300323120123001 |
5 | 213102341321140400001 |
6 | 2104211201443314305 |
7 | 64532124411454151 |
oct | 6237766073303301 |
9 | 1063345872318105 |
10 | 222100022200001 |
11 | 6484a0aa43a480 |
12 | 20ab058007b995 |
13 | 96c0c330ba2ba |
14 | 3cbb9ac6d0761 |
15 | 1aa24e80752bb |
hex | c9ffb0ed86c1 |
222100022200001 has 8 divisors (see below), whose sum is σ = 242294207205024. Its totient is φ = 201906382844320.
The previous prime is 222100022199971. The next prime is 222100022200003. The reversal of 222100022200001 is 100002220001222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 222100022200001 - 214 = 222100022183617 is a prime.
It is a super-2 number, since 2×2221000222000012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222100022200003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135561020 + ... + 137189613.
It is an arithmetic number, because the mean of its divisors is an integer number (30286775900628).
Almost surely, 2222100022200001 is an apocalyptic number.
It is an amenable number.
222100022200001 is a deficient number, since it is larger than the sum of its proper divisors (20194185005023).
222100022200001 is a wasteful number, since it uses less digits than its factorization.
222100022200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272824671.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 222100022200001 its reverse (100002220001222), we get a palindrome (322102242201223).
The spelling of 222100022200001 in words is "two hundred twenty-two trillion, one hundred billion, twenty-two million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.042 sec. • engine limits •