Base | Representation |
---|---|
bin | 10100101100000100… |
… | …111000000010100101 |
3 | 2010100011010222102001 |
4 | 110230010320002211 |
5 | 330443330441401 |
6 | 14112145445301 |
7 | 1414330352212 |
oct | 245404700245 |
9 | 63304128361 |
10 | 22214312101 |
11 | 946a444523 |
12 | 437b640831 |
13 | 213037a797 |
14 | 110a40ab09 |
15 | 8a0363601 |
hex | 52c1380a5 |
22214312101 has 8 divisors (see below), whose sum is σ = 22247872920. Its totient is φ = 22180773888.
The previous prime is 22214312089. The next prime is 22214312117. The reversal of 22214312101 is 10121341222.
It can be written as a sum of positive squares in 4 ways, for example, as 776959876 + 21437352225 = 27874^2 + 146415^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22214312101 - 29 = 22214311589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22214312171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3208095 + ... + 3215011.
It is an arithmetic number, because the mean of its divisors is an integer number (2780984115).
Almost surely, 222214312101 is an apocalyptic number.
It is an amenable number.
22214312101 is a deficient number, since it is larger than the sum of its proper divisors (33560819).
22214312101 is an equidigital number, since it uses as much as digits as its factorization.
22214312101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11303.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 22214312101 its reverse (10121341222), we get a palindrome (32335653323).
The spelling of 22214312101 in words is "twenty-two billion, two hundred fourteen million, three hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •