Base | Representation |
---|---|
bin | 1011000110010100100100… |
… | …1101010110000110011111 |
3 | 1121012121200002210012112021 |
4 | 2301211021031112012133 |
5 | 3044414203430314403 |
6 | 41542030413121011 |
7 | 2366440265162101 |
oct | 261451115260637 |
9 | 47177602705467 |
10 | 12203230323103 |
11 | 39853a741a616 |
12 | 1451099189167 |
13 | 6a69b5036641 |
14 | 3028d4add571 |
15 | 162679c828bd |
hex | b194935619f |
12203230323103 has 2 divisors, whose sum is σ = 12203230323104. Its totient is φ = 12203230323102.
The previous prime is 12203230323043. The next prime is 12203230323131. The reversal of 12203230323103 is 30132303230221.
12203230323103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (30132303230221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12203230323103 - 217 = 12203230192031 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12203230323133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101615161551 + 6101615161552.
It is an arithmetic number, because the mean of its divisors is an integer number (6101615161552).
Almost surely, 212203230323103 is an apocalyptic number.
12203230323103 is a deficient number, since it is larger than the sum of its proper divisors (1).
12203230323103 is an equidigital number, since it uses as much as digits as its factorization.
12203230323103 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 12203230323103 its reverse (30132303230221), we get a palindrome (42335533553324).
The spelling of 12203230323103 in words is "twelve trillion, two hundred three billion, two hundred thirty million, three hundred twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •