Base | Representation |
---|---|
bin | 10110011001001010… |
… | …00011101100100001 |
3 | 1011000211220002120012 |
4 | 23030211003230201 |
5 | 144110140413441 |
6 | 5304541254305 |
7 | 603631011020 |
oct | 131445035441 |
9 | 34024802505 |
10 | 12022201121 |
11 | 510a245707 |
12 | 23b6264395 |
13 | 1197938a98 |
14 | 82095a8b7 |
15 | 4a56a89eb |
hex | 2cc943b21 |
12022201121 has 4 divisors (see below), whose sum is σ = 13739658432. Its totient is φ = 10304743812.
The previous prime is 12022201067. The next prime is 12022201123. The reversal of 12022201121 is 12110222021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 12110222021 = 12097 ⋅1001093.
It is a cyclic number.
It is not a de Polignac number, because 12022201121 - 230 = 10948459297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12022201096 and 12022201105.
It is not an unprimeable number, because it can be changed into a prime (12022201123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 858728645 + ... + 858728658.
It is an arithmetic number, because the mean of its divisors is an integer number (3434914608).
Almost surely, 212022201121 is an apocalyptic number.
It is an amenable number.
12022201121 is a deficient number, since it is larger than the sum of its proper divisors (1717457311).
12022201121 is an equidigital number, since it uses as much as digits as its factorization.
12022201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1717457310.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12022201121 its reverse (12110222021), we get a palindrome (24132423142).
The spelling of 12022201121 in words is "twelve billion, twenty-two million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •