Base | Representation |
---|---|
bin | 1011000000111010000001… |
… | …0010110011100100110101 |
3 | 1120212201112210202102001002 |
4 | 2300032200102303210311 |
5 | 3041403143213414304 |
6 | 41431203335213045 |
7 | 2356635045231662 |
oct | 260164022634465 |
9 | 46781483672032 |
10 | 12110202091829 |
11 | 39499a9406556 |
12 | 1437056217185 |
13 | 69acaaa26c4a |
14 | 2dc1cb96aa69 |
15 | 160032b3731e |
hex | b03a04b3935 |
12110202091829 has 2 divisors, whose sum is σ = 12110202091830. Its totient is φ = 12110202091828.
The previous prime is 12110202091777. The next prime is 12110202091837. The reversal of 12110202091829 is 92819020201121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11884670182225 + 225531909604 = 3447415^2 + 474902^2 .
It is a cyclic number.
It is not a de Polignac number, because 12110202091829 - 28 = 12110202091573 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12110202091792 and 12110202091801.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12110202091529) 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, 6055101045914 + 6055101045915.
It is an arithmetic number, because the mean of its divisors is an integer number (6055101045915).
Almost surely, 212110202091829 is an apocalyptic number.
It is an amenable number.
12110202091829 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110202091829 is an equidigital number, since it uses as much as digits as its factorization.
12110202091829 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 38.
The spelling of 12110202091829 in words is "twelve trillion, one hundred ten billion, two hundred two million, ninety-one thousand, eight hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •