Base | Representation |
---|---|
bin | 1011000000011011100000… |
… | …0100010011110001111001 |
3 | 1120211221101221210100101021 |
4 | 2300012320010103301321 |
5 | 3041234404304311134 |
6 | 41423330452022441 |
7 | 2356225054210303 |
oct | 260067004236171 |
9 | 46757357710337 |
10 | 12102011010169 |
11 | 3946485797683 |
12 | 143554b001a21 |
13 | 69a2a3a2cc72 |
14 | 2dba51b62973 |
15 | 15ec039950b4 |
hex | b01b8113c79 |
12102011010169 has 2 divisors, whose sum is σ = 12102011010170. Its totient is φ = 12102011010168.
The previous prime is 12102011010143. The next prime is 12102011010211. The reversal of 12102011010169 is 96101011020121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7369123739769 + 4732887270400 = 2714613^2 + 2175520^2 .
It is a cyclic number.
It is not a de Polignac number, because 12102011010169 - 29 = 12102011009657 is a prime.
It is a super-3 number, since 3×121020110101693 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (12102011010569) 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, 6051005505084 + 6051005505085.
It is an arithmetic number, because the mean of its divisors is an integer number (6051005505085).
Almost surely, 212102011010169 is an apocalyptic number.
It is an amenable number.
12102011010169 is a deficient number, since it is larger than the sum of its proper divisors (1).
12102011010169 is an equidigital number, since it uses as much as digits as its factorization.
12102011010169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 25.
The spelling of 12102011010169 in words is "twelve trillion, one hundred two billion, eleven million, ten thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •