Base | Representation |
---|---|
bin | 1011111011101111100010… |
… | …0111011111010001101101 |
3 | 1201110100121010122112220112 |
4 | 2332323320213133101231 |
5 | 3204433302303121102 |
6 | 43523412120425405 |
7 | 2522650433131163 |
oct | 276737047372155 |
9 | 51410533575815 |
10 | 13121001223277 |
11 | 41a9649143772 |
12 | 157ab30918265 |
13 | 7423c741a69c |
14 | 3350ba317233 |
15 | 17b4924b1252 |
hex | beef89df46d |
13121001223277 has 2 divisors, whose sum is σ = 13121001223278. Its totient is φ = 13121001223276.
The previous prime is 13121001223151. The next prime is 13121001223279. The reversal of 13121001223277 is 77232210012131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12871691745796 + 249309477481 = 3587714^2 + 499309^2 .
It is a cyclic number.
It is not a de Polignac number, because 13121001223277 - 236 = 13052281746541 is a prime.
Together with 13121001223279, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13121001223279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6560500611638 + 6560500611639.
It is an arithmetic number, because the mean of its divisors is an integer number (6560500611639).
Almost surely, 213121001223277 is an apocalyptic number.
It is an amenable number.
13121001223277 is a deficient number, since it is larger than the sum of its proper divisors (1).
13121001223277 is an equidigital number, since it uses as much as digits as its factorization.
13121001223277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7056, while the sum is 32.
The spelling of 13121001223277 in words is "thirteen trillion, one hundred twenty-one billion, one million, two hundred twenty-three thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •