Base | Representation |
---|---|
bin | 110101100111100001… |
… | …1010110000100101011 |
3 | 102000012111200212221112 |
4 | 1223033003112010223 |
5 | 3341303041112001 |
6 | 124521304100535 |
7 | 11214230405615 |
oct | 1531703260453 |
9 | 360174625845 |
10 | 115142910251 |
11 | 44917197766 |
12 | 1a39516474b |
13 | ab1cb44675 |
14 | 5804245db5 |
15 | 2edd87ccbb |
hex | 1acf0d612b |
115142910251 has 2 divisors, whose sum is σ = 115142910252. Its totient is φ = 115142910250.
The previous prime is 115142910241. The next prime is 115142910329. The reversal of 115142910251 is 152019241511.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 115142910251 - 210 = 115142909227 is a prime.
It is not a weakly prime, because it can be changed into another prime (115142910241) 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, 57571455125 + 57571455126.
It is an arithmetic number, because the mean of its divisors is an integer number (57571455126).
Almost surely, 2115142910251 is an apocalyptic number.
115142910251 is a deficient number, since it is larger than the sum of its proper divisors (1).
115142910251 is an equidigital number, since it uses as much as digits as its factorization.
115142910251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 32.
The spelling of 115142910251 in words is "one hundred fifteen billion, one hundred forty-two million, nine hundred ten thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •