Base | Representation |
---|---|
bin | 10110011001001000… |
… | …10111110001100101 |
3 | 1011000211112221210020 |
4 | 23030210113301211 |
5 | 144110114134341 |
6 | 5304533345353 |
7 | 603626331360 |
oct | 131444276145 |
9 | 34024487706 |
10 | 12022021221 |
11 | 510a132531 |
12 | 23b6198259 |
13 | 11978a4c32 |
14 | 8209110d7 |
15 | 4a5670566 |
hex | 2cc917c65 |
12022021221 has 16 divisors (see below), whose sum is σ = 19283443200. Its totient is φ = 6508161648.
The previous prime is 12022021171. The next prime is 12022021229. The reversal of 12022021221 is 12212022021.
12022021221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12022021221 - 211 = 12022019173 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12022021221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12022021229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15064791 + ... + 15065588.
It is an arithmetic number, because the mean of its divisors is an integer number (1205215200).
Almost surely, 212022021221 is an apocalyptic number.
It is an amenable number.
12022021221 is a deficient number, since it is larger than the sum of its proper divisors (7261421979).
12022021221 is a wasteful number, since it uses less digits than its factorization.
12022021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30130408.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 12022021221 its reverse (12212022021), we get a palindrome (24234043242).
The spelling of 12022021221 in words is "twelve billion, twenty-two million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •