Base | Representation |
---|---|
bin | 10110010110110001… |
… | …10000101010010101 |
3 | 1010222110020221110211 |
4 | 23023120300222111 |
5 | 144040030401323 |
6 | 5302544445421 |
7 | 603266006233 |
oct | 131330605225 |
9 | 33873227424 |
10 | 12002200213 |
11 | 50a9a24733 |
12 | 23ab619871 |
13 | 1193755123 |
14 | 81c031953 |
15 | 4a3a5770d |
hex | 2cb630a95 |
12002200213 has 2 divisors, whose sum is σ = 12002200214. Its totient is φ = 12002200212.
The previous prime is 12002200211. The next prime is 12002200253. The reversal of 12002200213 is 31200220021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6247005444 + 5755194769 = 79038^2 + 75863^2 .
It is a cyclic number.
It is not a de Polignac number, because 12002200213 - 21 = 12002200211 is a prime.
Together with 12002200211, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12002200193 and 12002200202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12002200211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001100106 + 6001100107.
It is an arithmetic number, because the mean of its divisors is an integer number (6001100107).
Almost surely, 212002200213 is an apocalyptic number.
It is an amenable number.
12002200213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12002200213 is an equidigital number, since it uses as much as digits as its factorization.
12002200213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 12002200213 its reverse (31200220021), we get a palindrome (43202420234).
It can be divided in two parts, 1200220021 and 3, that multiplied together give a palindrome (3600660063).
The spelling of 12002200213 in words is "twelve billion, two million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •