Base | Representation |
---|---|
bin | 11001110000111001011111… |
… | …100111001010001101011111 |
3 | 112212012110121110202111110002 |
4 | 121300321133213022031133 |
5 | 104322443302403212111 |
6 | 1040554315233004515 |
7 | 32603323620263312 |
oct | 3160713747121537 |
9 | 485173543674402 |
10 | 113311431304031 |
11 | 33117120a48074 |
12 | 108606210b373b |
13 | 4b2c2b700958c |
14 | 1dda43423c979 |
15 | d17754e9d63b |
hex | 670e5f9ca35f |
113311431304031 has 2 divisors, whose sum is σ = 113311431304032. Its totient is φ = 113311431304030.
The previous prime is 113311431303991. The next prime is 113311431304037. The reversal of 113311431304031 is 130403134113311.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113311431304031 is a prime.
It is a super-2 number, since 2×1133114313040312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113311431303985 and 113311431304003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113311431304037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56655715652015 + 56655715652016.
It is an arithmetic number, because the mean of its divisors is an integer number (56655715652016).
Almost surely, 2113311431304031 is an apocalyptic number.
113311431304031 is a deficient number, since it is larger than the sum of its proper divisors (1).
113311431304031 is an equidigital number, since it uses as much as digits as its factorization.
113311431304031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 29.
Adding to 113311431304031 its reverse (130403134113311), we get a palindrome (243714565417342).
The spelling of 113311431304031 in words is "one hundred thirteen trillion, three hundred eleven billion, four hundred thirty-one million, three hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •