Base | Representation |
---|---|
bin | 1010000000100100110101… |
… | …11001101000000001010101 |
3 | 2212221010200112012010120120 |
4 | 11000102122321220001111 |
5 | 10341103000333101401 |
6 | 114451132022222153 |
7 | 4431112411351260 |
oct | 500223271500125 |
9 | 85833615163516 |
10 | 22010011222101 |
11 | 70164365981a1 |
12 | 2575830284959 |
13 | c386c5964466 |
14 | 56140c551cd7 |
15 | 2827e6bdb836 |
hex | 14049ae68055 |
22010011222101 has 16 divisors (see below), whose sum is σ = 33546794534400. Its totient is φ = 12574250589168.
The previous prime is 22010011222099. The next prime is 22010011222153. The reversal of 22010011222101 is 10122211001022.
It is not a de Polignac number, because 22010011222101 - 21 = 22010011222099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22010011222201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 120685071 + ... + 120867308.
It is an arithmetic number, because the mean of its divisors is an integer number (2096674658400).
Almost surely, 222010011222101 is an apocalyptic number.
22010011222101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
22010011222101 is a deficient number, since it is larger than the sum of its proper divisors (11536783312299).
22010011222101 is a wasteful number, since it uses less digits than its factorization.
22010011222101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241556728.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22010011222101 its reverse (10122211001022), we get a palindrome (32132222223123).
The spelling of 22010011222101 in words is "twenty-two trillion, ten billion, eleven million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •