Base | Representation |
---|---|
bin | 1010000110011001100011… |
… | …10101100101111000101011 |
3 | 2220122021011220010212210220 |
4 | 11003030301311211320223 |
5 | 10402342302134120021 |
6 | 115123103512541123 |
7 | 4451425165152606 |
oct | 503146165457053 |
9 | 86567156125726 |
10 | 22210112020011 |
11 | 709328a245353 |
12 | 25a85756b17a3 |
13 | c51534b16366 |
14 | 56ad91b9133d |
15 | 287b08e21cc6 |
hex | 143331d65e2b |
22210112020011 has 16 divisors (see below), whose sum is σ = 29701204502400. Its totient is φ = 14762887283648.
The previous prime is 22210112020001. The next prime is 22210112020021. The reversal of 22210112020011 is 11002021101222.
It is an interprime number because it is at equal distance from previous prime (22210112020001) and next prime (22210112020021).
It is a cyclic number.
It is not a de Polignac number, because 22210112020011 - 211 = 22210112017963 is a prime.
It is not an unprimeable number, because it can be changed into a prime (22210112020001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12235600 + ... + 13933058.
It is an arithmetic number, because the mean of its divisors is an integer number (1856325281400).
Almost surely, 222210112020011 is an apocalyptic number.
22210112020011 is a deficient number, since it is larger than the sum of its proper divisors (7491092482389).
22210112020011 is a wasteful number, since it uses less digits than its factorization.
22210112020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1710378.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22210112020011 its reverse (11002021101222), we get a palindrome (33212133121233).
The spelling of 22210112020011 in words is "twenty-two trillion, two hundred ten billion, one hundred twelve million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •