Base | Representation |
---|---|
bin | 10110101110100111… |
… | …01101100011000011 |
3 | 1011111101121011011201 |
4 | 23113103231203003 |
5 | 144442231001311 |
6 | 5334451322031 |
7 | 611245005553 |
oct | 132723554303 |
9 | 34441534151 |
10 | 12202203331 |
11 | 51a1909a6a |
12 | 24465b0317 |
13 | 11c6010976 |
14 | 83a815163 |
15 | 4b63b29c1 |
hex | 2d74ed8c3 |
12202203331 has 2 divisors, whose sum is σ = 12202203332. Its totient is φ = 12202203330.
The previous prime is 12202203329. The next prime is 12202203347. The reversal of 12202203331 is 13330220221.
It is a weak prime.
It is an emirp because it is prime and its reverse (13330220221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12202203331 - 21 = 12202203329 is a prime.
It is a super-2 number, since 2×122022033312 (a number of 21 digits) contains 22 as substring.
Together with 12202203329, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12202203299 and 12202203308.
It is not a weakly prime, because it can be changed into another prime (12202203371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101101665 + 6101101666.
It is an arithmetic number, because the mean of its divisors is an integer number (6101101666).
Almost surely, 212202203331 is an apocalyptic number.
12202203331 is a deficient number, since it is larger than the sum of its proper divisors (1).
12202203331 is an equidigital number, since it uses as much as digits as its factorization.
12202203331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 12202203331 its reverse (13330220221), we get a palindrome (25532423552).
The spelling of 12202203331 in words is "twelve billion, two hundred two million, two hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •