Base | Representation |
---|---|
bin | 110100101010101110… |
… | …1110000010100011111 |
3 | 101210221100021101012002 |
4 | 1221111131300110133 |
5 | 3323113332410101 |
6 | 123543034032515 |
7 | 11112540515012 |
oct | 1512535602437 |
9 | 353840241162 |
10 | 113103013151 |
11 | 43a6a77a897 |
12 | 19b05b7873b |
13 | a88633b56b |
14 | 568d363379 |
15 | 2e1e738d6b |
hex | 1a5577051f |
113103013151 has 2 divisors, whose sum is σ = 113103013152. Its totient is φ = 113103013150.
The previous prime is 113103013147. The next prime is 113103013171. The reversal of 113103013151 is 151310301311.
It is an a-pointer prime, because the next prime (113103013171) can be obtained adding 113103013151 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 113103013151 - 22 = 113103013147 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113103013171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56551506575 + 56551506576.
It is an arithmetic number, because the mean of its divisors is an integer number (56551506576).
Almost surely, 2113103013151 is an apocalyptic number.
113103013151 is a deficient number, since it is larger than the sum of its proper divisors (1).
113103013151 is an equidigital number, since it uses as much as digits as its factorization.
113103013151 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 135, while the sum is 20.
Adding to 113103013151 its reverse (151310301311), we get a palindrome (264413314462).
The spelling of 113103013151 in words is "one hundred thirteen billion, one hundred three million, thirteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •