Base | Representation |
---|---|
bin | 11001110011100011111111… |
… | …101001100110011000010101 |
3 | 112212211222011012002000121001 |
4 | 121303203333221212120111 |
5 | 104333443221230042233 |
6 | 1041214353352023301 |
7 | 32622464430342514 |
oct | 3163437751463025 |
9 | 485758135060531 |
10 | 113494504924693 |
11 | 33187827263a12 |
12 | 1088bbb4091b31 |
13 | 4b43641670b79 |
14 | 200524032667b |
15 | d1c3bc43e27d |
hex | 6738ffa66615 |
113494504924693 has 2 divisors, whose sum is σ = 113494504924694. Its totient is φ = 113494504924692.
The previous prime is 113494504924621. The next prime is 113494504924747. The reversal of 113494504924693 is 396429405494311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110539107282564 + 2955397642129 = 10513758^2 + 1719127^2 .
It is a cyclic number.
It is not a de Polignac number, because 113494504924693 - 233 = 113485914990101 is a prime.
It is a super-2 number, since 2×1134945049246932 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113494504924613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56747252462346 + 56747252462347.
It is an arithmetic number, because the mean of its divisors is an integer number (56747252462347).
Almost surely, 2113494504924693 is an apocalyptic number.
It is an amenable number.
113494504924693 is a deficient number, since it is larger than the sum of its proper divisors (1).
113494504924693 is an equidigital number, since it uses as much as digits as its factorization.
113494504924693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100776960, while the sum is 64.
The spelling of 113494504924693 in words is "one hundred thirteen trillion, four hundred ninety-four billion, five hundred four million, nine hundred twenty-four thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •