Base | Representation |
---|---|
bin | 1010000000011000010111… |
… | …00011000111001001101001 |
3 | 2212220111101120221022100110 |
4 | 11000030023203013021221 |
5 | 10341000240132223423 |
6 | 114444103121524533 |
7 | 4430454364244451 |
oct | 500141343071151 |
9 | 85814346838313 |
10 | 22003311211113 |
11 | 701360860a831 |
12 | 25744804a3749 |
13 | c37b9885430b |
14 | 560d747a4d61 |
15 | 2825538cd193 |
hex | 14030b8c7269 |
22003311211113 has 16 divisors (see below), whose sum is σ = 30613411391616. Its totient is φ = 14031047120640.
The previous prime is 22003311210989. The next prime is 22003311211153. The reversal of 22003311211113 is 31111211330022.
It is a de Polignac number, because none of the positive numbers 2k-22003311211113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22003311211113.
It is not an unprimeable number, because it can be changed into a prime (22003311211153) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35396403 + ... + 36012663.
It is an arithmetic number, because the mean of its divisors is an integer number (1913338211976).
Almost surely, 222003311211113 is an apocalyptic number.
22003311211113 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
22003311211113 is a deficient number, since it is larger than the sum of its proper divisors (8610100180503).
22003311211113 is a wasteful number, since it uses less digits than its factorization.
22003311211113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1133744.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 22003311211113 its reverse (31111211330022), we get a palindrome (53114522541135).
The spelling of 22003311211113 in words is "twenty-two trillion, three billion, three hundred eleven million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •