Base | Representation |
---|---|
bin | 1011000110010100100101… |
… | …0000011001001010111101 |
3 | 1121012121200011021210120002 |
4 | 2301211021100121022331 |
5 | 3044414204131401414 |
6 | 41542030442204045 |
7 | 2366440305030416 |
oct | 261451120311275 |
9 | 47177604253502 |
10 | 12203231122109 |
11 | 39853a7915955 |
12 | 14510994b3625 |
13 | 6a69b5256221 |
14 | 3028d4c6a80d |
15 | 162679d8e4de |
hex | b19494192bd |
12203231122109 has 2 divisors, whose sum is σ = 12203231122110. Its totient is φ = 12203231122108.
The previous prime is 12203231122081. The next prime is 12203231122111. The reversal of 12203231122109 is 90122113230221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6918188760025 + 5285042362084 = 2630245^2 + 2298922^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12203231122109 is a prime.
Together with 12203231122111, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12203231122169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101615561054 + 6101615561055.
It is an arithmetic number, because the mean of its divisors is an integer number (6101615561055).
Almost surely, 212203231122109 is an apocalyptic number.
It is an amenable number.
12203231122109 is a deficient number, since it is larger than the sum of its proper divisors (1).
12203231122109 is an equidigital number, since it uses as much as digits as its factorization.
12203231122109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 29.
It can be divided in two parts, 1220323 and 1122109, that added together give a palindrome (2342432).
The spelling of 12203231122109 in words is "twelve trillion, two hundred three billion, two hundred thirty-one million, one hundred twenty-two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •