Base | Representation |
---|---|
bin | 1011000110110101010010… |
… | …1001001010110110111001 |
3 | 1121020110100010020202011022 |
4 | 2301231110221022312321 |
5 | 3100040200044213144 |
6 | 41550042041112225 |
7 | 2400201021103205 |
oct | 261552451126671 |
9 | 47213303222138 |
10 | 12212012101049 |
11 | 39890a3512342 |
12 | 145292a188675 |
13 | 6a778451c557 |
14 | 3030c914bb05 |
15 | 1629e0c05cee |
hex | b1b54a4adb9 |
12212012101049 has 2 divisors, whose sum is σ = 12212012101050. Its totient is φ = 12212012101048.
The previous prime is 12212012100997. The next prime is 12212012101129. The reversal of 12212012101049 is 94010121021221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9423886927225 + 2788125173824 = 3069835^2 + 1669768^2 .
It is a cyclic number.
It is not a de Polignac number, because 12212012101049 - 228 = 12211743665593 is a prime.
It is a super-2 number, since 2×122120121010492 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (12212012101649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106006050524 + 6106006050525.
It is an arithmetic number, because the mean of its divisors is an integer number (6106006050525).
Almost surely, 212212012101049 is an apocalyptic number.
It is an amenable number.
12212012101049 is a deficient number, since it is larger than the sum of its proper divisors (1).
12212012101049 is an equidigital number, since it uses as much as digits as its factorization.
12212012101049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 12212012101049 in words is "twelve trillion, two hundred twelve billion, twelve million, one hundred one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •