Base | Representation |
---|---|
bin | 110010000001011100110101… |
… | …001000011111100110000011 |
3 | 1001211221222121201202011202012 |
4 | 302001130311020133212003 |
5 | 212314003044303101034 |
6 | 2055523305112443135 |
7 | 64224422452421102 |
oct | 6201346510374603 |
9 | 1054858551664665 |
10 | 220002001222019 |
11 | 64110363282085 |
12 | 20811a410a94ab |
13 | 959b13b057253 |
14 | 3c48221978039 |
15 | 1a67b54979cce |
hex | c8173521f983 |
220002001222019 has 4 divisors (see below), whose sum is σ = 221141907964296. Its totient is φ = 218862094479744.
The previous prime is 220002001221983. The next prime is 220002001222021. The reversal of 220002001222019 is 910222100200022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220002001222019 is a prime.
It is a super-2 number, since 2×2200020012220192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220002001221985 and 220002001222003.
It is not an unprimeable number, because it can be changed into a prime (220002001222079) 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, 569953370849 + ... + 569953371234.
It is an arithmetic number, because the mean of its divisors is an integer number (55285476991074).
Almost surely, 2220002001222019 is an apocalyptic number.
220002001222019 is a deficient number, since it is larger than the sum of its proper divisors (1139906742277).
220002001222019 is a wasteful number, since it uses less digits than its factorization.
220002001222019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1139906742276.
The product of its (nonzero) digits is 576, while the sum is 23.
The spelling of 220002001222019 in words is "two hundred twenty trillion, two billion, one million, two hundred twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •