Base | Representation |
---|---|
bin | 100000000100101001111… |
… | …101101010010001010101 |
3 | 21210200222002201010210002 |
4 | 200010221331222101111 |
5 | 242102314144041004 |
6 | 4404302553541045 |
7 | 315143504016101 |
oct | 40045175522125 |
9 | 7720862633702 |
10 | 2204022252629 |
11 | 77a7a2114a0a |
12 | 2b71a2714785 |
13 | 12cab8c96792 |
14 | 78964c38901 |
15 | 3c4e962061e |
hex | 20129f6a455 |
2204022252629 has 8 divisors (see below), whose sum is σ = 2334800646240. Its totient is φ = 2074721581296.
The previous prime is 2204022252611. The next prime is 2204022252637. The reversal of 2204022252629 is 9262522204022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2204022252629 is a prime.
It is a super-2 number, since 2×22040222526292 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2204022252592 and 2204022252601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2204022252329) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 369427499 + ... + 369433464.
It is an arithmetic number, because the mean of its divisors is an integer number (291850080780).
Almost surely, 22204022252629 is an apocalyptic number.
It is an amenable number.
2204022252629 is a deficient number, since it is larger than the sum of its proper divisors (130778393611).
2204022252629 is a wasteful number, since it uses less digits than its factorization.
2204022252629 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 738861139.
The product of its (nonzero) digits is 138240, while the sum is 38.
The spelling of 2204022252629 in words is "two trillion, two hundred four billion, twenty-two million, two hundred fifty-two thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •