Base | Representation |
---|---|
bin | 100000010011101000110… |
… | …001000101000001010101 |
3 | 21212020111011110020111212 |
4 | 200103220301011001111 |
5 | 242333240211220334 |
6 | 4415523105511205 |
7 | 316253232136316 |
oct | 40235061050125 |
9 | 7766434406455 |
10 | 2220108304469 |
11 | 7865a7294830 |
12 | 2ba331942505 |
13 | 13148081b853 |
14 | 7964d3aa60d |
15 | 3cb3b962ece |
hex | 204e8c45055 |
2220108304469 has 4 divisors (see below), whose sum is σ = 2421936332160. Its totient is φ = 2018280276780.
The previous prime is 2220108304409. The next prime is 2220108304523. The reversal of 2220108304469 is 9644038010222.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2220108304469 is a prime.
It is a super-2 number, since 2×22201083044692 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2220108304409) 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, 100914013829 + ... + 100914013850.
It is an arithmetic number, because the mean of its divisors is an integer number (605484083040).
Almost surely, 22220108304469 is an apocalyptic number.
It is an amenable number.
2220108304469 is a deficient number, since it is larger than the sum of its proper divisors (201828027691).
2220108304469 is a wasteful number, since it uses less digits than its factorization.
2220108304469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201828027690.
The product of its (nonzero) digits is 165888, while the sum is 41.
The spelling of 2220108304469 in words is "two trillion, two hundred twenty billion, one hundred eight million, three hundred four thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •