Base | Representation |
---|---|
bin | 1010000000010010011000… |
… | …10101100011110011100011 |
3 | 2212220012010000111222102020 |
4 | 11000021030111203303203 |
5 | 10340422202410211321 |
6 | 114442412523152523 |
7 | 4430312031552240 |
oct | 500111425436343 |
9 | 85805100458366 |
10 | 22000103210211 |
11 | 70122117a2215 |
12 | 2573926075743 |
13 | c377a7043b29 |
14 | 560b4c6d65c7 |
15 | 282416e4e4c6 |
hex | 14024c563ce3 |
22000103210211 has 8 divisors (see below), whose sum is σ = 33523966796544. Its totient is φ = 12571487548680.
The previous prime is 22000103210179. The next prime is 22000103210279. The reversal of 22000103210211 is 11201230100022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22000103210211 - 25 = 22000103210179 is a prime.
It is not an unprimeable number, because it can be changed into a prime (22000103210291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 523811981175 + ... + 523811981216.
It is an arithmetic number, because the mean of its divisors is an integer number (4190495849568).
Almost surely, 222000103210211 is an apocalyptic number.
22000103210211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
22000103210211 is a deficient number, since it is larger than the sum of its proper divisors (11523863586333).
22000103210211 is a wasteful number, since it uses less digits than its factorization.
22000103210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047623962401.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 22000103210211 its reverse (11201230100022), we get a palindrome (33201333310233).
The spelling of 22000103210211 in words is "twenty-two trillion, one hundred three million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •