Base | Representation |
---|---|
bin | 1000101111010010001… |
… | …0000010110100101111 |
3 | 112100111220211000210202 |
4 | 2023310202002310233 |
5 | 4424432123000411 |
6 | 152545222024115 |
7 | 13563253203554 |
oct | 2136442026457 |
9 | 470456730722 |
10 | 150131453231 |
11 | 58741322991 |
12 | 2511a87803b |
13 | 11207886536 |
14 | 73a300ca2b |
15 | 3d8a3e883b |
hex | 22f4882d2f |
150131453231 has 2 divisors, whose sum is σ = 150131453232. Its totient is φ = 150131453230.
The previous prime is 150131453123. The next prime is 150131453249. The reversal of 150131453231 is 132354131051.
Together with previous prime (150131453123) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150131453231 is a prime.
It is a super-2 number, since 2×1501314532312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 150131453194 and 150131453203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150131453261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75065726615 + 75065726616.
It is an arithmetic number, because the mean of its divisors is an integer number (75065726616).
Almost surely, 2150131453231 is an apocalyptic number.
150131453231 is a deficient number, since it is larger than the sum of its proper divisors (1).
150131453231 is an equidigital number, since it uses as much as digits as its factorization.
150131453231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 150131453231 its reverse (132354131051), we get a palindrome (282485584282).
The spelling of 150131453231 in words is "one hundred fifty billion, one hundred thirty-one million, four hundred fifty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •