Base | Representation |
---|---|
bin | 11001101100011001010100… |
… | …101011000100001101110001 |
3 | 112211002212221101020102010221 |
4 | 121230121110223010031301 |
5 | 104302411104043231421 |
6 | 1040200223511253041 |
7 | 32542061103602026 |
oct | 3154312453041561 |
9 | 484085841212127 |
10 | 113002010133361 |
11 | 33007979844908 |
12 | 1081066867a181 |
13 | 4b090753b5b8b |
14 | 1dc947dbad54d |
15 | d0e69566b841 |
hex | 66c654ac4371 |
113002010133361 has 2 divisors, whose sum is σ = 113002010133362. Its totient is φ = 113002010133360.
The previous prime is 113002010133283. The next prime is 113002010133367. The reversal of 113002010133361 is 163331010200311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83734505230336 + 29267504903025 = 9150656^2 + 5409945^2 .
It is an emirp because it is prime and its reverse (163331010200311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113002010133361 - 215 = 113002010100593 is a prime.
It is not a weakly prime, because it can be changed into another prime (113002010133367) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56501005066680 + 56501005066681.
It is an arithmetic number, because the mean of its divisors is an integer number (56501005066681).
Almost surely, 2113002010133361 is an apocalyptic number.
It is an amenable number.
113002010133361 is a deficient number, since it is larger than the sum of its proper divisors (1).
113002010133361 is an equidigital number, since it uses as much as digits as its factorization.
113002010133361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 113002010133361 its reverse (163331010200311), we get a palindrome (276333020333672).
The spelling of 113002010133361 in words is "one hundred thirteen trillion, two billion, ten million, one hundred thirty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •