Base | Representation |
---|---|
bin | 11001101100010111101111… |
… | …100001111001101001101111 |
3 | 112211002201120010012220001202 |
4 | 121230113233201321221233 |
5 | 104302344120141410413 |
6 | 1040155343253000115 |
7 | 32542001050303502 |
oct | 3154275741715157 |
9 | 484081503186052 |
10 | 113000313231983 |
11 | 330071889a8781 |
12 | 1081027432303b |
13 | 4b08b64982b18 |
14 | 1dc935c693139 |
15 | d0e5e66cae58 |
hex | 66c5ef879a6f |
113000313231983 has 2 divisors, whose sum is σ = 113000313231984. Its totient is φ = 113000313231982.
The previous prime is 113000313231979. The next prime is 113000313232039. The reversal of 113000313231983 is 389132313000311.
It is a weak prime.
It is an emirp because it is prime and its reverse (389132313000311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113000313231983 - 22 = 113000313231979 is a prime.
It is a super-2 number, since 2×1130003132319832 (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 (113000313237983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56500156615991 + 56500156615992.
It is an arithmetic number, because the mean of its divisors is an integer number (56500156615992).
Almost surely, 2113000313231983 is an apocalyptic number.
113000313231983 is a deficient number, since it is larger than the sum of its proper divisors (1).
113000313231983 is an equidigital number, since it uses as much as digits as its factorization.
113000313231983 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 38.
The spelling of 113000313231983 in words is "one hundred thirteen trillion, three hundred thirteen million, two hundred thirty-one thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •