Base | Representation |
---|---|
bin | 11001000000101110011100… |
… | …011101001000111010010101 |
3 | 112102110222220002000011112222 |
4 | 121000232130131020322111 |
5 | 103404224103232132404 |
6 | 1025541435425352125 |
7 | 32112212061115205 |
oct | 3100563435107225 |
9 | 472428802004488 |
10 | 110001032302229 |
11 | 320601a3017132 |
12 | 10406b2b198645 |
13 | 494c08c10b493 |
14 | 1d2411509a405 |
15 | cab5a5174dbe |
hex | 640b9c748e95 |
110001032302229 has 2 divisors, whose sum is σ = 110001032302230. Its totient is φ = 110001032302228.
The previous prime is 110001032302123. The next prime is 110001032302247. The reversal of 110001032302229 is 922203230100011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61449889644004 + 48551142658225 = 7838998^2 + 6967865^2 .
It is a cyclic number.
It is not a de Polignac number, because 110001032302229 - 220 = 110001031253653 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110001032302198 and 110001032302207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110001032302289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000516151114 + 55000516151115.
It is an arithmetic number, because the mean of its divisors is an integer number (55000516151115).
Almost surely, 2110001032302229 is an apocalyptic number.
It is an amenable number.
110001032302229 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001032302229 is an equidigital number, since it uses as much as digits as its factorization.
110001032302229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 26.
The spelling of 110001032302229 in words is "one hundred ten trillion, one billion, thirty-two million, three hundred two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •