Base | Representation |
---|---|
bin | 1011000000010101001010… |
… | …1100010001101011001101 |
3 | 1120211210000102102210220201 |
4 | 2300011102230101223031 |
5 | 3041222413403230102 |
6 | 41422450014013501 |
7 | 2356134652520041 |
oct | 260052254215315 |
9 | 46753012383821 |
10 | 12100310211277 |
11 | 3945792729262 |
12 | 14351554a7291 |
13 | 69a092563ba2 |
14 | 2db92dd10021 |
15 | 15eb544d4987 |
hex | b0152b11acd |
12100310211277 has 2 divisors, whose sum is σ = 12100310211278. Its totient is φ = 12100310211276.
The previous prime is 12100310211259. The next prime is 12100310211289. The reversal of 12100310211277 is 77211201300121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6781133691721 + 5319176519556 = 2604061^2 + 2306334^2 .
It is a cyclic number.
It is not a de Polignac number, because 12100310211277 - 219 = 12100309686989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12100310211377) 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, 6050155105638 + 6050155105639.
It is an arithmetic number, because the mean of its divisors is an integer number (6050155105639).
Almost surely, 212100310211277 is an apocalyptic number.
It is an amenable number.
12100310211277 is a deficient number, since it is larger than the sum of its proper divisors (1).
12100310211277 is an equidigital number, since it uses as much as digits as its factorization.
12100310211277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1176, while the sum is 28.
Adding to 12100310211277 its reverse (77211201300121), we get a palindrome (89311511511398).
The spelling of 12100310211277 in words is "twelve trillion, one hundred billion, three hundred ten million, two hundred eleven thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •