Base | Representation |
---|---|
bin | 110100101110110100… |
… | …0101111010000111101 |
3 | 101211021220020121220101 |
4 | 1221131220233100331 |
5 | 3323403432011031 |
6 | 124004412321101 |
7 | 11116124024464 |
oct | 1513550572075 |
9 | 354256217811 |
10 | 113240110141 |
11 | 440300a9894 |
12 | 19b43a73191 |
13 | a8a8870442 |
14 | 56a364d9db |
15 | 2e2b7ba361 |
hex | 1a5da2f43d |
113240110141 has 2 divisors, whose sum is σ = 113240110142. Its totient is φ = 113240110140.
The previous prime is 113240110091. The next prime is 113240110153. The reversal of 113240110141 is 141011042311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86772074041 + 26468036100 = 294571^2 + 162690^2 .
It is an emirp because it is prime and its reverse (141011042311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113240110141 - 29 = 113240109629 is a prime.
It is a super-2 number, since 2×1132401101412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113240116141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56620055070 + 56620055071.
It is an arithmetic number, because the mean of its divisors is an integer number (56620055071).
Almost surely, 2113240110141 is an apocalyptic number.
It is an amenable number.
113240110141 is a deficient number, since it is larger than the sum of its proper divisors (1).
113240110141 is an equidigital number, since it uses as much as digits as its factorization.
113240110141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 113240110141 its reverse (141011042311), we get a palindrome (254251152452).
The spelling of 113240110141 in words is "one hundred thirteen billion, two hundred forty million, one hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •