Base | Representation |
---|---|
bin | 11001110100011011110100… |
… | …110110010001100111111001 |
3 | 112220001200220002101222200222 |
4 | 121310123310312101213321 |
5 | 104340434010012142223 |
6 | 1041302110132305425 |
7 | 32630016131536061 |
oct | 3164336466214771 |
9 | 486050802358628 |
10 | 113554453240313 |
11 | 3320019a54a808 |
12 | 1089b744772275 |
13 | 4b491a64a3087 |
14 | 20080c9da43a1 |
15 | d1dc2a3830c8 |
hex | 6746f4d919f9 |
113554453240313 has 2 divisors, whose sum is σ = 113554453240314. Its totient is φ = 113554453240312.
The previous prime is 113554453240297. The next prime is 113554453240367. The reversal of 113554453240313 is 313042354455311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98771635545664 + 14782817694649 = 9938392^2 + 3844843^2 .
It is a cyclic number.
It is not a de Polignac number, because 113554453240313 - 24 = 113554453240297 is a prime.
It is a super-2 number, since 2×1135544532403132 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (113554453249313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56777226620156 + 56777226620157.
It is an arithmetic number, because the mean of its divisors is an integer number (56777226620157).
Almost surely, 2113554453240313 is an apocalyptic number.
It is an amenable number.
113554453240313 is a deficient number, since it is larger than the sum of its proper divisors (1).
113554453240313 is an equidigital number, since it uses as much as digits as its factorization.
113554453240313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296000, while the sum is 44.
The spelling of 113554453240313 in words is "one hundred thirteen trillion, five hundred fifty-four billion, four hundred fifty-three million, two hundred forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •