Base | Representation |
---|---|
bin | 1011000110110010101110… |
… | …0100011000101001010101 |
3 | 1121020101120002112211002122 |
4 | 2301230223210120221111 |
5 | 3100032242140342244 |
6 | 41545445422545325 |
7 | 2400144652504541 |
oct | 261545344305125 |
9 | 47211502484078 |
10 | 12211322980949 |
11 | 398887a5241a4 |
12 | 1452777438245 |
13 | 6a76a481c391 |
14 | 303061806a21 |
15 | 1629a04821ee |
hex | b1b2b918a55 |
12211322980949 has 2 divisors, whose sum is σ = 12211322980950. Its totient is φ = 12211322980948.
The previous prime is 12211322980897. The next prime is 12211322980973. The reversal of 12211322980949 is 94908922311221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6921240180625 + 5290082800324 = 2630825^2 + 2300018^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12211322980949 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12211322980949.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12211322980049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105661490474 + 6105661490475.
It is an arithmetic number, because the mean of its divisors is an integer number (6105661490475).
Almost surely, 212211322980949 is an apocalyptic number.
It is an amenable number.
12211322980949 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211322980949 is an equidigital number, since it uses as much as digits as its factorization.
12211322980949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1119744, while the sum is 53.
The spelling of 12211322980949 in words is "twelve trillion, two hundred eleven billion, three hundred twenty-two million, nine hundred eighty thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •