Base | Representation |
---|---|
bin | 100010001101011010011100… |
… | …101000000101110011110011 |
3 | 201201201101111210012210222112 |
4 | 202031122130220011303303 |
5 | 124210030010011243011 |
6 | 1251554120403555535 |
7 | 43456016250061613 |
oct | 4215323450056363 |
9 | 651641453183875 |
10 | 150455332134131 |
11 | 43a37825699a32 |
12 | 14a5b30238bbab |
13 | 65c4b52844b0b |
14 | 292211114aa43 |
15 | 125da4d87e58b |
hex | 88d69ca05cf3 |
150455332134131 has 2 divisors, whose sum is σ = 150455332134132. Its totient is φ = 150455332134130.
The previous prime is 150455332134049. The next prime is 150455332134161. The reversal of 150455332134131 is 131431233554051.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 150455332134131 - 210 = 150455332133107 is a prime.
It is a super-2 number, since 2×1504553321341312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (150455332134161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75227666067065 + 75227666067066.
It is an arithmetic number, because the mean of its divisors is an integer number (75227666067066).
Almost surely, 2150455332134131 is an apocalyptic number.
150455332134131 is a deficient number, since it is larger than the sum of its proper divisors (1).
150455332134131 is an equidigital number, since it uses as much as digits as its factorization.
150455332134131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 41.
Adding to 150455332134131 its reverse (131431233554051), we get a palindrome (281886565688182).
The spelling of 150455332134131 in words is "one hundred fifty trillion, four hundred fifty-five billion, three hundred thirty-two million, one hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •