Base | Representation |
---|---|
bin | 1010111011110001110110… |
… | …1010011000101101010110 |
3 | 1120120022011121000222022100 |
4 | 2232330131222120231112 |
5 | 3033432240421041042 |
6 | 41322514231542530 |
7 | 2350366056243654 |
oct | 256743552305526 |
9 | 46508147028270 |
10 | 12022111112022 |
11 | 3915604341600 |
12 | 1421b7082aa46 |
13 | 6928ac57611b |
14 | 2d7c32403dd4 |
15 | 15cac919b24c |
hex | aef1da98b56 |
12022111112022 has 72 divisors (see below), whose sum is σ = 28893842817840. Its totient is φ = 3609641296800.
The previous prime is 12022111111973. The next prime is 12022111112041. The reversal of 12022111112022 is 22021111122021.
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 = 12022111111986 and 12022111112004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 25082754 + ... + 25557557.
It is an arithmetic number, because the mean of its divisors is an integer number (401303372470).
Almost surely, 212022111112022 is an apocalyptic number.
12022111112022 is an abundant number, since it is smaller than the sum of its proper divisors (16871731705818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12022111112022 is a wasteful number, since it uses less digits than its factorization.
12022111112022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50640450 (or 50640436 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 12022111112022 its reverse (22021111122021), we get a palindrome (34043222234043).
Subtracting 12022111112022 from its reverse (22021111122021), we obtain a palindrome (9999000009999).
The spelling of 12022111112022 in words is "twelve trillion, twenty-two billion, one hundred eleven million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •