Base | Representation |
---|---|
bin | 1001100011110100110000… |
… | …00000000111000001001010 |
3 | 2202102200202200210001120200 |
4 | 10301322120000013001022 |
5 | 10223411300222042302 |
6 | 112413232331233030 |
7 | 4266540506435646 |
oct | 461723000070112 |
9 | 82380680701520 |
10 | 21022120112202 |
11 | 67754818376a0 |
12 | 24362895a8776 |
13 | b964ba267561 |
14 | 52969438dc26 |
15 | 266c7855481c |
hex | 131e9800704a |
21022120112202 has 48 divisors (see below), whose sum is σ = 49689715263552. Its totient is φ = 6370202540160.
The previous prime is 21022120112197. The next prime is 21022120112219. The reversal of 21022120112202 is 20221102122012.
It is a happy number.
21022120112202 is a `hidden beast` number, since 21 + 0 + 221 + 201 + 1 + 220 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8293378 + ... + 10527314.
It is an arithmetic number, because the mean of its divisors is an integer number (1035202401324).
Almost surely, 221022120112202 is an apocalyptic number.
21022120112202 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21022120112202 is an abundant number, since it is smaller than the sum of its proper divisors (28667595151350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21022120112202 is a wasteful number, since it uses less digits than its factorization.
21022120112202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2281483 (or 2281480 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 21022120112202 its reverse (20221102122012), we get a palindrome (41243222234214).
The spelling of 21022120112202 in words is "twenty-one trillion, twenty-two billion, one hundred twenty million, one hundred twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •