Base | Representation |
---|---|
bin | 11001101111010001110011… |
… | …111011110001001001100111 |
3 | 112211210211020211002211002022 |
4 | 121233101303323301021213 |
5 | 104314132302343213111 |
6 | 1040431224235133355 |
7 | 32562303040210022 |
oct | 3157216373611147 |
9 | 484724224084068 |
10 | 113200103101031 |
11 | 33083992097431 |
12 | 10842b315a425b |
13 | 4b219545ab64b |
14 | 1dd4cb28b61b9 |
15 | d148db4942db |
hex | 66f473ef1267 |
113200103101031 has 2 divisors, whose sum is σ = 113200103101032. Its totient is φ = 113200103101030.
The previous prime is 113200103101013. The next prime is 113200103101051. The reversal of 113200103101031 is 130101301002311.
Together with previous prime (113200103101013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113200103101031 is a prime.
It is a super-2 number, since 2×1132001031010312 (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 (113200103101051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56600051550515 + 56600051550516.
It is an arithmetic number, because the mean of its divisors is an integer number (56600051550516).
Almost surely, 2113200103101031 is an apocalyptic number.
113200103101031 is a deficient number, since it is larger than the sum of its proper divisors (1).
113200103101031 is an equidigital number, since it uses as much as digits as its factorization.
113200103101031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 113200103101031 its reverse (130101301002311), we get a palindrome (243301404103342).
The spelling of 113200103101031 in words is "one hundred thirteen trillion, two hundred billion, one hundred three million, one hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •