Base | Representation |
---|---|
bin | 1010000110011011100110… |
… | …10010000011101110100111 |
3 | 2220122101000102012010000021 |
4 | 11003031303102003232213 |
5 | 10402402024230020234 |
6 | 115123404454300011 |
7 | 4451464326640363 |
oct | 503156322035647 |
9 | 86571012163007 |
10 | 22211210001319 |
11 | 70937a3000a19 |
12 | 25a8821357607 |
13 | c5167b43b241 |
14 | 56b0579262a3 |
15 | 287b705099b4 |
hex | 143373483ba7 |
22211210001319 has 16 divisors (see below), whose sum is σ = 23857455220480. Its totient is φ = 20616506078400.
The previous prime is 22211210001313. The next prime is 22211210001367. The reversal of 22211210001319 is 91310001211222.
It is a cyclic number.
It is not a de Polignac number, because 22211210001319 - 223 = 22211201612711 is a prime.
It is a super-2 number, since 2×222112100013192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22211210001293 and 22211210001302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22211210001313) 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, 52816557 + ... + 53235430.
It is an arithmetic number, because the mean of its divisors is an integer number (1491090951280).
Almost surely, 222211210001319 is an apocalyptic number.
22211210001319 is a deficient number, since it is larger than the sum of its proper divisors (1646245219161).
22211210001319 is a wasteful number, since it uses less digits than its factorization.
22211210001319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106052230.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 22211210001319 in words is "twenty-two trillion, two hundred eleven billion, two hundred ten million, one thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •