Base | Representation |
---|---|
bin | 10110101111100010… |
… | …11101010100111101 |
3 | 1011111221021022212011 |
4 | 23113301131110331 |
5 | 200001230014323 |
6 | 5335330411221 |
7 | 611401204114 |
oct | 132761352475 |
9 | 34457238764 |
10 | 12210001213 |
11 | 51a62556a3 |
12 | 2449130b11 |
13 | 11c78110b7 |
14 | 83b884c7b |
15 | 4b6e0320d |
hex | 2d7c5d53d |
12210001213 has 2 divisors, whose sum is σ = 12210001214. Its totient is φ = 12210001212.
The previous prime is 12210001211. The next prime is 12210001241. The reversal of 12210001213 is 31210001221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7677614884 + 4532386329 = 87622^2 + 67323^2 .
It is a cyclic number.
It is not a de Polignac number, because 12210001213 - 21 = 12210001211 is a prime.
It is a super-2 number, since 2×122100012132 (a number of 21 digits) contains 22 as substring.
Together with 12210001211, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12210001193 and 12210001202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12210001211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105000606 + 6105000607.
It is an arithmetic number, because the mean of its divisors is an integer number (6105000607).
Almost surely, 212210001213 is an apocalyptic number.
It is an amenable number.
12210001213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12210001213 is an equidigital number, since it uses as much as digits as its factorization.
12210001213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 12210001213 its reverse (31210001221), we get a palindrome (43420002434).
The spelling of 12210001213 in words is "twelve billion, two hundred ten million, one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •