Base | Representation |
---|---|
bin | 1010000000100110101100… |
… | …11100011101100110011001 |
3 | 2212221020021010221222121211 |
4 | 11000103112130131212121 |
5 | 10341112022103211301 |
6 | 114451415110103121 |
7 | 4431146231536105 |
oct | 500232634354631 |
9 | 85836233858554 |
10 | 22011010210201 |
11 | 70168a948a7a1 |
12 | 2575a6a94aaa1 |
13 | c38824908b8c |
14 | 5614a50b8905 |
15 | 28285476d051 |
hex | 1404d671d999 |
22011010210201 has 4 divisors (see below), whose sum is σ = 22237927841332. Its totient is φ = 21784092579072.
The previous prime is 22011010210199. The next prime is 22011010210289. The reversal of 22011010210201 is 10201201011022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4430599800201 + 17580410410000 = 2104899^2 + 4192900^2 .
It is a cyclic number.
It is not a de Polignac number, because 22011010210201 - 21 = 22011010210199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22011010210901) 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, 113458815420 + ... + 113458815613.
It is an arithmetic number, because the mean of its divisors is an integer number (5559481960333).
Almost surely, 222011010210201 is an apocalyptic number.
It is an amenable number.
22011010210201 is a deficient number, since it is larger than the sum of its proper divisors (226917631131).
22011010210201 is an equidigital number, since it uses as much as digits as its factorization.
22011010210201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226917631130.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22011010210201 its reverse (10201201011022), we get a palindrome (32212211221223).
The spelling of 22011010210201 in words is "twenty-two trillion, eleven billion, ten million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •