Base | Representation |
---|---|
bin | 1010000110110011011100… |
… | …0000000111011110000101 |
3 | 1110100022000121101100101112 |
4 | 2201230313000013132011 |
5 | 2424024340303002404 |
6 | 35344441144134405 |
7 | 2224546540350131 |
oct | 241546700073605 |
9 | 43308017340345 |
10 | 11112003172229 |
11 | 35a4635112a63 |
12 | 12b56b7467405 |
13 | 627b1b93916b |
14 | 2a5b767dc3c1 |
15 | 1440ae58e56e |
hex | a1b37007785 |
11112003172229 has 2 divisors, whose sum is σ = 11112003172230. Its totient is φ = 11112003172228.
The previous prime is 11112003172219. The next prime is 11112003172273. The reversal of 11112003172229 is 92227130021111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10739207447329 + 372795724900 = 3277073^2 + 610570^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112003172229 - 24 = 11112003172213 is a prime.
It is a super-2 number, since 2×111120031722292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11112003172195 and 11112003172204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11112003172219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556001586114 + 5556001586115.
It is an arithmetic number, because the mean of its divisors is an integer number (5556001586115).
Almost surely, 211112003172229 is an apocalyptic number.
It is an amenable number.
11112003172229 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112003172229 is an equidigital number, since it uses as much as digits as its factorization.
11112003172229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3024, while the sum is 32.
The spelling of 11112003172229 in words is "eleven trillion, one hundred twelve billion, three million, one hundred seventy-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •