Base | Representation |
---|---|
bin | 1011000000111010000001… |
… | …0110011000101011010101 |
3 | 1120212201112212112002021122 |
4 | 2300032200112120223111 |
5 | 3041403143433431404 |
6 | 41431203411253325 |
7 | 2356635056220563 |
oct | 260164026305325 |
9 | 46781485462248 |
10 | 12110203030229 |
11 | 39499a9997597 |
12 | 14370565aa245 |
13 | 69acaac95105 |
14 | 2dc1cbb32a33 |
15 | 160032c703be |
hex | b03a0598ad5 |
12110203030229 has 2 divisors, whose sum is σ = 12110203030230. Its totient is φ = 12110203030228.
The previous prime is 12110203030171. The next prime is 12110203030301. The reversal of 12110203030229 is 92203030201121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12109717929604 + 485100625 = 3479902^2 + 22025^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12110203030229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12110203030198 and 12110203030207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12110203030529) 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, 6055101515114 + 6055101515115.
It is an arithmetic number, because the mean of its divisors is an integer number (6055101515115).
Almost surely, 212110203030229 is an apocalyptic number.
It is an amenable number.
12110203030229 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110203030229 is an equidigital number, since it uses as much as digits as its factorization.
12110203030229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The spelling of 12110203030229 in words is "twelve trillion, one hundred ten billion, two hundred three million, thirty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •