Base | Representation |
---|---|
bin | 10110101110011111… |
… | …11000111000010001 |
3 | 1011111022201020110121 |
4 | 23113033320320101 |
5 | 144442001414134 |
6 | 5334414030241 |
7 | 611233333033 |
oct | 132717707021 |
9 | 34438636417 |
10 | 12201201169 |
11 | 51a1295033 |
12 | 24461a8381 |
13 | 11c5a4c781 |
14 | 83a633c53 |
15 | 4b6265ab4 |
hex | 2d73f8e11 |
12201201169 has 2 divisors, whose sum is σ = 12201201170. Its totient is φ = 12201201168.
The previous prime is 12201201167. The next prime is 12201201209. The reversal of 12201201169 is 96110210221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11280988944 + 920212225 = 106212^2 + 30335^2 .
It is an emirp because it is prime and its reverse (96110210221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12201201169 - 21 = 12201201167 is a prime.
It is a super-2 number, since 2×122012011692 (a number of 21 digits) contains 22 as substring.
Together with 12201201167, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (12201201167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100600584 + 6100600585.
It is an arithmetic number, because the mean of its divisors is an integer number (6100600585).
Almost surely, 212201201169 is an apocalyptic number.
It is an amenable number.
12201201169 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201201169 is an equidigital number, since it uses as much as digits as its factorization.
12201201169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 12201201169 in words is "twelve billion, two hundred one million, two hundred one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •