Base | Representation |
---|---|
bin | 10110100011101001… |
… | …01111110010011001 |
3 | 1011020222110220021111 |
4 | 23101310233302121 |
5 | 144300202344321 |
6 | 5321403340321 |
7 | 606050000266 |
oct | 132164576231 |
9 | 34228426244 |
10 | 12110199961 |
11 | 515498a522 |
12 | 241b8216a1 |
13 | 11acc39bc2 |
14 | 82c50626d |
15 | 4ad28c5e1 |
hex | 2d1d2fc99 |
12110199961 has 2 divisors, whose sum is σ = 12110199962. Its totient is φ = 12110199960.
The previous prime is 12110199923. The next prime is 12110200021. The reversal of 12110199961 is 16999101121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9968824336 + 2141375625 = 99844^2 + 46275^2 .
It is a cyclic number.
It is not a de Polignac number, because 12110199961 - 27 = 12110199833 is a prime.
It is not a weakly prime, because it can be changed into another prime (12110199911) 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, 6055099980 + 6055099981.
It is an arithmetic number, because the mean of its divisors is an integer number (6055099981).
Almost surely, 212110199961 is an apocalyptic number.
It is an amenable number.
12110199961 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110199961 is an equidigital number, since it uses as much as digits as its factorization.
12110199961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 40.
The spelling of 12110199961 in words is "twelve billion, one hundred ten million, one hundred ninety-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •