Base | Representation |
---|---|
bin | 10110110000110110… |
… | …11010100110010001 |
3 | 1011112200222010110122 |
4 | 23120123122212101 |
5 | 200012034000311 |
6 | 5340402240025 |
7 | 611563533563 |
oct | 133033324621 |
9 | 34480863418 |
10 | 12221000081 |
11 | 5201488274 |
12 | 2450956015 |
13 | 11c9b924c4 |
14 | 83d109333 |
15 | 4b7d770db |
hex | 2d86da991 |
12221000081 has 2 divisors, whose sum is σ = 12221000082. Its totient is φ = 12221000080.
The previous prime is 12221000053. The next prime is 12221000111. The reversal of 12221000081 is 18000012221.
It is a happy number.
12221000081 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10290276481 + 1930723600 = 101441^2 + 43940^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12221000081 is a prime.
It is a super-2 number, since 2×122210000812 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12221000041) 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 as a sum of consecutive naturals, namely, 6110500040 + 6110500041.
It is an arithmetic number, because the mean of its divisors is an integer number (6110500041).
Almost surely, 212221000081 is an apocalyptic number.
It is an amenable number.
12221000081 is a deficient number, since it is larger than the sum of its proper divisors (1).
12221000081 is an equidigital number, since it uses as much as digits as its factorization.
12221000081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
The spelling of 12221000081 in words is "twelve billion, two hundred twenty-one million, eighty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •