Base | Representation |
---|---|
bin | 101101111110101100000011… |
… | …011001000110101010101010 |
3 | 222112000001011122021001211022 |
4 | 231332230003121012222222 |
5 | 203001133031020010442 |
6 | 1554030330403132442 |
7 | 60410625111022463 |
oct | 5576540331065252 |
9 | 875001148231738 |
10 | 202220002110122 |
11 | 59485026365757 |
12 | 1a81b711674122 |
13 | 88ab358aa8629 |
14 | 37d1700c69d6a |
15 | 185a3165273d2 |
hex | b7eb03646aaa |
202220002110122 has 16 divisors (see below), whose sum is σ = 303388553916000. Its totient is φ = 101090484820752.
The previous prime is 202220002110059. The next prime is 202220002110149. The reversal of 202220002110122 is 221011200022202.
It is a happy number.
202220002110122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2022200021101222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 202220002110122.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 747269213 + ... + 747539775.
It is an arithmetic number, because the mean of its divisors is an integer number (18961784619750).
Almost surely, 2202220002110122 is an apocalyptic number.
202220002110122 is a deficient number, since it is larger than the sum of its proper divisors (101168551805878).
202220002110122 is a wasteful number, since it uses less digits than its factorization.
202220002110122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341317.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 202220002110122 its reverse (221011200022202), we get a palindrome (423231202132324).
The spelling of 202220002110122 in words is "two hundred two trillion, two hundred twenty billion, two million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •