Base | Representation |
---|---|
bin | 1001100011100000000011… |
… | …11010000110111111001110 |
3 | 2202101122002112221121202200 |
4 | 10301300001322012333032 |
5 | 10223221023034202342 |
6 | 112404154202302330 |
7 | 4265665315304655 |
oct | 461600172067716 |
9 | 82348075847680 |
10 | 21011012022222 |
11 | 67707a1592242 |
12 | 24340a94b79a6 |
13 | b95439b26051 |
14 | 528d1cdc419c |
15 | 26682826394c |
hex | 131c01e86fce |
21011012022222 has 48 divisors (see below), whose sum is σ = 46994691194880. Its totient is φ = 6777411166800.
The previous prime is 21011012022151. The next prime is 21011012022239. The reversal of 21011012022222 is 22222021011012.
It is a happy number.
21011012022222 is a `hidden beast` number, since 210 + 110 + 120 + 2 + 2 + 222 = 666.
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 = 21011012022195 and 21011012022204.
It is a congruent number.
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, 10507947 + ... + 12346617.
It is an arithmetic number, because the mean of its divisors is an integer number (979056066560).
Almost surely, 221011012022222 is an apocalyptic number.
21011012022222 is an abundant number, since it is smaller than the sum of its proper divisors (25983679172658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21011012022222 is a wasteful number, since it uses less digits than its factorization.
21011012022222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1859189 (or 1859186 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 21011012022222 its reverse (22222021011012), we get a palindrome (43233033033234).
The spelling of 21011012022222 in words is "twenty-one trillion, eleven billion, twelve million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •