Base | Representation |
---|---|
bin | 100000000010110011001… |
… | …110111110001101000110 |
3 | 21210111211021111120020200 |
4 | 200002303032332031012 |
5 | 242034224224131042 |
6 | 4403333155311330 |
7 | 315043235510655 |
oct | 40026316761506 |
9 | 7714737446220 |
10 | 2202030302022 |
11 | 77996a775a41 |
12 | 2b69275ab546 |
13 | 12c85c3aa195 |
14 | 7881647719c |
15 | 3c42e7ecc4c |
hex | 200b33be346 |
2202030302022 has 24 divisors (see below), whose sum is σ = 4978503292464. Its totient is φ = 702096617904.
The previous prime is 2202030302011. The next prime is 2202030302111.
2202030302022 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2202030301986 and 2202030302004.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2659456473 + ... + 2659457300.
It is an arithmetic number, because the mean of its divisors is an integer number (207437637186).
Almost surely, 22202030302022 is an apocalyptic number.
2202030302022 is an abundant number, since it is smaller than the sum of its proper divisors (2776472990442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2202030302022 is a wasteful number, since it uses less digits than its factorization.
2202030302022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5318913804 (or 5318913801 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 18.
It can be divided in two parts, 2202030 and 302022, that added together give a palindrome (2504052).
The spelling of 2202030302022 in words is "two trillion, two hundred two billion, thirty million, three hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •