Base | Representation |
---|---|
bin | 100010001000101011111110… |
… | …010011100011111001011111 |
3 | 201200120100012101201221000201 |
4 | 202020223332103203321133 |
5 | 124134214333132430043 |
6 | 1251145005112404331 |
7 | 43423401032323432 |
oct | 4210537623437137 |
9 | 650510171657021 |
10 | 150130553405023 |
11 | 43922012557814 |
12 | 14a083826a66a7 |
13 | 65a03342a3a29 |
14 | 29105011bd819 |
15 | 1255390b59c4d |
hex | 888afe4e3e5f |
150130553405023 has 2 divisors, whose sum is σ = 150130553405024. Its totient is φ = 150130553405022.
The previous prime is 150130553404987. The next prime is 150130553405039. The reversal of 150130553405023 is 320504355031051.
It is a strong prime.
It is an emirp because it is prime and its reverse (320504355031051) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150130553405023 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150130553405083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75065276702511 + 75065276702512.
It is an arithmetic number, because the mean of its divisors is an integer number (75065276702512).
Almost surely, 2150130553405023 is an apocalyptic number.
150130553405023 is a deficient number, since it is larger than the sum of its proper divisors (1).
150130553405023 is an equidigital number, since it uses as much as digits as its factorization.
150130553405023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 37.
The spelling of 150130553405023 in words is "one hundred fifty trillion, one hundred thirty billion, five hundred fifty-three million, four hundred five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •