Base | Representation |
---|---|
bin | 1010000010000010110100… |
… | …0011111000110111110101 |
3 | 1110001110221211111220212222 |
4 | 2200200231003320313311 |
5 | 2421204403343311404 |
6 | 35243115120252125 |
7 | 2215623301056665 |
oct | 240405503706765 |
9 | 43043854456788 |
10 | 11030232010229 |
11 | 3572993459733 |
12 | 12a1896471045 |
13 | 6201b98a03c3 |
14 | 2a1c1a7361a5 |
15 | 141dc5861dbe |
hex | a082d0f8df5 |
11030232010229 has 2 divisors, whose sum is σ = 11030232010230. Its totient is φ = 11030232010228.
The previous prime is 11030232010163. The next prime is 11030232010253. The reversal of 11030232010229 is 92201023203011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11022333600100 + 7898410129 = 3319990^2 + 88873^2 .
It is an emirp because it is prime and its reverse (92201023203011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11030232010229 - 212 = 11030232006133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11030232010198 and 11030232010207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11030232010129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515116005114 + 5515116005115.
It is an arithmetic number, because the mean of its divisors is an integer number (5515116005115).
Almost surely, 211030232010229 is an apocalyptic number.
It is an amenable number.
11030232010229 is a deficient number, since it is larger than the sum of its proper divisors (1).
11030232010229 is an equidigital number, since it uses as much as digits as its factorization.
11030232010229 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 11030232010229 in words is "eleven trillion, thirty billion, two hundred thirty-two million, ten thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •