Base | Representation |
---|---|
bin | 101111110001010111111010… |
… | …001010001101101101010110 |
3 | 1000112220110200202022021020220 |
4 | 233301113322022031231112 |
5 | 210014244034210400042 |
6 | 2022503041331535210 |
7 | 62153206264335231 |
oct | 5761277212155526 |
9 | 1015813622267226 |
10 | 210101112200022 |
11 | 60a4342156a83a |
12 | 1b69300545a506 |
13 | 90305b0489854 |
14 | 39c4d3b7aa418 |
15 | 194532abb28ec |
hex | bf15fa28db56 |
210101112200022 has 8 divisors (see below), whose sum is σ = 420202224400056. Its totient is φ = 70033704066672.
The previous prime is 210101112199961. The next prime is 210101112200047. The reversal of 210101112200022 is 220002211101012.
It is a sphenic number, since it is the product of 3 distinct primes.
210101112200022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 210101112199974 and 210101112200010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17508426016663 + ... + 17508426016674.
It is an arithmetic number, because the mean of its divisors is an integer number (52525278050007).
Almost surely, 2210101112200022 is an apocalyptic number.
210101112200022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210101112200022 is a wasteful number, since it uses less digits than its factorization.
210101112200022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35016852033342.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210101112200022 its reverse (220002211101012), we get a palindrome (430103323301034).
The spelling of 210101112200022 in words is "two hundred ten trillion, one hundred one billion, one hundred twelve million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •