Base | Representation |
---|---|
bin | 1011001100000100100110… |
… | …1010001001101010110001 |
3 | 1121120001200001222120122221 |
4 | 2303001021222021222301 |
5 | 3103024020130402121 |
6 | 42055245420201041 |
7 | 2406535401464632 |
oct | 263011152115261 |
9 | 47501601876587 |
10 | 12302022122161 |
11 | 3a13292858442 |
12 | 146826a399181 |
13 | 6b30ca43cb85 |
14 | 3075c74d7889 |
15 | 16500cdb1b41 |
hex | b3049a89ab1 |
12302022122161 has 2 divisors, whose sum is σ = 12302022122162. Its totient is φ = 12302022122160.
The previous prime is 12302022122149. The next prime is 12302022122267. The reversal of 12302022122161 is 16122122020321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12173686224561 + 128335897600 = 3489081^2 + 358240^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12302022122161 is a prime.
It is not a weakly prime, because it can be changed into another prime (12302022122461) 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, 6151011061080 + 6151011061081.
It is an arithmetic number, because the mean of its divisors is an integer number (6151011061081).
Almost surely, 212302022122161 is an apocalyptic number.
It is an amenable number.
12302022122161 is a deficient number, since it is larger than the sum of its proper divisors (1).
12302022122161 is an equidigital number, since it uses as much as digits as its factorization.
12302022122161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 12302022122161 its reverse (16122122020321), we get a palindrome (28424144142482).
The spelling of 12302022122161 in words is "twelve trillion, three hundred two billion, twenty-two million, one hundred twenty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •