Base | Representation |
---|---|
bin | 110100101011100100… |
… | …0111100101010001101 |
3 | 101211000022011000001222 |
4 | 1221113020330222031 |
5 | 3323143031104401 |
6 | 123545520213125 |
7 | 11113331411036 |
oct | 1512710745215 |
9 | 354008130058 |
10 | 113131113101 |
11 | 43a84622796 |
12 | 19b1346a1a5 |
13 | a88c0c9756 |
14 | 5692d99a8d |
15 | 2e21e39c1b |
hex | 1a5723ca8d |
113131113101 has 2 divisors, whose sum is σ = 113131113102. Its totient is φ = 113131113100.
The previous prime is 113131113083. The next prime is 113131113113. The reversal of 113131113101 is 101311131311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73251422500 + 39879690601 = 270650^2 + 199699^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113131113101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113131113101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113131113401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56565556550 + 56565556551.
It is an arithmetic number, because the mean of its divisors is an integer number (56565556551).
Almost surely, 2113131113101 is an apocalyptic number.
It is an amenable number.
113131113101 is a deficient number, since it is larger than the sum of its proper divisors (1).
113131113101 is an equidigital number, since it uses as much as digits as its factorization.
113131113101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 113131113101 its reverse (101311131311), we get a palindrome (214442244412).
The spelling of 113131113101 in words is "one hundred thirteen billion, one hundred thirty-one million, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •