Base | Representation |
---|---|
bin | 1011000110110010010011… |
… | …1101110111111010100001 |
3 | 1121020101021101010200112112 |
4 | 2301230210331313322201 |
5 | 3100032030312101423 |
6 | 41545430425005105 |
7 | 2400142136202512 |
oct | 261544475677241 |
9 | 47211241120475 |
10 | 12211212222113 |
11 | 3988822a54473 |
12 | 1452746323795 |
13 | 6a76878ac7c8 |
14 | 303050c14a09 |
15 | 1629958a4a78 |
hex | b1b24f77ea1 |
12211212222113 has 2 divisors, whose sum is σ = 12211212222114. Its totient is φ = 12211212222112.
The previous prime is 12211212221933. The next prime is 12211212222119. The reversal of 12211212222113 is 31122221211221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7753067131489 + 4458145090624 = 2784433^2 + 2111432^2 .
It is a cyclic number.
It is not a de Polignac number, because 12211212222113 - 232 = 12206917254817 is a prime.
It is a super-2 number, since 2×122112122221132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12211212222119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105606111056 + 6105606111057.
It is an arithmetic number, because the mean of its divisors is an integer number (6105606111057).
Almost surely, 212211212222113 is an apocalyptic number.
It is an amenable number.
12211212222113 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211212222113 is an equidigital number, since it uses as much as digits as its factorization.
12211212222113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 384, while the sum is 23.
Adding to 12211212222113 its reverse (31122221211221), we get a palindrome (43333433433334).
The spelling of 12211212222113 in words is "twelve trillion, two hundred eleven billion, two hundred twelve million, two hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •