Base | Representation |
---|---|
bin | 101101111110101100001001… |
… | …111100010011010001100100 |
3 | 222112000001110022001001112111 |
4 | 231332230021330103101210 |
5 | 203001133242133000400 |
6 | 1554030345330330404 |
7 | 60410630614045435 |
oct | 5576541174232144 |
9 | 875001408031474 |
10 | 202220112000100 |
11 | 594850823a1717 |
12 | 1a81b742429a04 |
13 | 88ab3757a289c |
14 | 37d17116b348c |
15 | 185a320ed23ba |
hex | b7eb09f13464 |
202220112000100 has 36 divisors (see below), whose sum is σ = 442167396069168. Its totient is φ = 80270578804000.
The previous prime is 202220112000091. The next prime is 202220112000103. The reversal of 202220112000100 is 1000211022202.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (202220112000103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7718311786 + ... + 7718337985.
It is an arithmetic number, because the mean of its divisors is an integer number (12282427668588).
Almost surely, 2202220112000100 is an apocalyptic number.
202220112000100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202220112000100 is an abundant number, since it is smaller than the sum of its proper divisors (239947284069068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202220112000100 is a wasteful number, since it uses less digits than its factorization.
202220112000100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15436649916 (or 15436649909 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 202220112000100 its reverse (1000211022202), we get a palindrome (203220323022302).
The spelling of 202220112000100 in words is "two hundred two trillion, two hundred twenty billion, one hundred twelve million, one hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •