Base | Representation |
---|---|
bin | 100111101010101… |
… | …1101100011101101 |
3 | 10102202120010122002 |
4 | 1033111131203231 |
5 | 10211220314112 |
6 | 340024302045 |
7 | 44661351506 |
oct | 11725354355 |
9 | 3382503562 |
10 | 1331026157 |
11 | 62336971a |
12 | 311911925 |
13 | 1829ac056 |
14 | c8ab9bad |
15 | 7bcbd1c2 |
hex | 4f55d8ed |
1331026157 has 2 divisors, whose sum is σ = 1331026158. Its totient is φ = 1331026156.
The previous prime is 1331026127. The next prime is 1331026159. The reversal of 1331026157 is 7516201331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1209717961 + 121308196 = 34781^2 + 11014^2 .
It is a cyclic number.
It is not a de Polignac number, because 1331026157 - 212 = 1331022061 is a prime.
Together with 1331026159, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1331026159) 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, 665513078 + 665513079.
It is an arithmetic number, because the mean of its divisors is an integer number (665513079).
Almost surely, 21331026157 is an apocalyptic number.
It is an amenable number.
1331026157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331026157 is an equidigital number, since it uses as much as digits as its factorization.
1331026157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 29.
The square root of 1331026157 is about 36483.2311754318. The cubic root of 1331026157 is about 1100.0072057379.
Adding to 1331026157 its reverse (7516201331), we get a palindrome (8847227488).
The spelling of 1331026157 in words is "one billion, three hundred thirty-one million, twenty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •