Base | Representation |
---|---|
bin | 100010010111011101110001… |
… | …101010111110000000111001 |
3 | 201211011102111200002022202022 |
4 | 202113131301222332000321 |
5 | 124302334203401444001 |
6 | 1253243321010244225 |
7 | 43556642201222522 |
oct | 4227356152760071 |
9 | 654142450068668 |
10 | 151146101203001 |
11 | 44183779838423 |
12 | 14b51163586675 |
13 | 6645029737718 |
14 | 29477204c5849 |
15 | 12719cc34111b |
hex | 897771abe039 |
151146101203001 has 2 divisors, whose sum is σ = 151146101203002. Its totient is φ = 151146101203000.
The previous prime is 151146101202947. The next prime is 151146101203037. The reversal of 151146101203001 is 100302101641151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134674841292601 + 16471259910400 = 11604949^2 + 4058480^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151146101203001 is a prime.
It is a super-2 number, since 2×1511461012030012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (151146101203061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75573050601500 + 75573050601501.
It is an arithmetic number, because the mean of its divisors is an integer number (75573050601501).
Almost surely, 2151146101203001 is an apocalyptic number.
It is an amenable number.
151146101203001 is a deficient number, since it is larger than the sum of its proper divisors (1).
151146101203001 is an equidigital number, since it uses as much as digits as its factorization.
151146101203001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 26.
Adding to 151146101203001 its reverse (100302101641151), we get a palindrome (251448202844152).
The spelling of 151146101203001 in words is "one hundred fifty-one trillion, one hundred forty-six billion, one hundred one million, two hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •