Base | Representation |
---|---|
bin | 1011000110110101101100… |
… | …0101001010010010000110 |
3 | 1121020110121122110202122100 |
4 | 2301231123011022102012 |
5 | 3100040410221231042 |
6 | 41550100500012530 |
7 | 2400203502100641 |
oct | 261553305122206 |
9 | 47213548422570 |
10 | 12212120102022 |
11 | 3989149479045 |
12 | 145295a391146 |
13 | 6a77a0a04a59 |
14 | 3030d9622a58 |
15 | 1629ea43b24c |
hex | b1b5b14a486 |
12212120102022 has 24 divisors (see below), whose sum is σ = 26459767455264. Its totient is φ = 4070679946704.
The previous prime is 12212120102003. The next prime is 12212120102029. The reversal of 12212120102022 is 22020102121221.
It is a happy number.
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 = 12212120101986 and 12212120102004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12212120102029) 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, 688563 + ... + 4989825.
It is an arithmetic number, because the mean of its divisors is an integer number (1102490310636).
Almost surely, 212212120102022 is an apocalyptic number.
12212120102022 is an abundant number, since it is smaller than the sum of its proper divisors (14247647353242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12212120102022 is a wasteful number, since it uses less digits than its factorization.
12212120102022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4459004 (or 4459001 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 12212120102022 its reverse (22020102121221), we get a palindrome (34232222223243).
The spelling of 12212120102022 in words is "twelve trillion, two hundred twelve billion, one hundred twenty million, one hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •