Base | Representation |
---|---|
bin | 110101100111101101… |
… | …1100011010111010111 |
3 | 102000012221122021212212 |
4 | 1223033123203113113 |
5 | 3341311202144101 |
6 | 124522052104035 |
7 | 11214335346026 |
oct | 1531733432727 |
9 | 360187567785 |
10 | 115149256151 |
11 | 4491a831506 |
12 | 1a39730501b |
13 | ab21256c37 |
14 | 58050188bd |
15 | 2ede1d31bb |
hex | 1acf6e35d7 |
115149256151 has 2 divisors, whose sum is σ = 115149256152. Its totient is φ = 115149256150.
The previous prime is 115149256121. The next prime is 115149256207. The reversal of 115149256151 is 151652941511.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 115149256151 - 226 = 115082147287 is a prime.
It is a super-2 number, since 2×1151492561512 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115149256099 and 115149256108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115149256121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57574628075 + 57574628076.
It is an arithmetic number, because the mean of its divisors is an integer number (57574628076).
Almost surely, 2115149256151 is an apocalyptic number.
115149256151 is a deficient number, since it is larger than the sum of its proper divisors (1).
115149256151 is an equidigital number, since it uses as much as digits as its factorization.
115149256151 is an evil number, because the sum of its binary digits is even.
The product of its digits is 54000, while the sum is 41.
The spelling of 115149256151 in words is "one hundred fifteen billion, one hundred forty-nine million, two hundred fifty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •