Base | Representation |
---|---|
bin | 1000110001000010001… |
… | …1010110000010010001 |
3 | 112101201200101201201121 |
4 | 2030100203112002101 |
5 | 4431412444243423 |
6 | 153104014002241 |
7 | 13611022051111 |
oct | 2142043260221 |
9 | 471650351647 |
10 | 150601556113 |
11 | 5896271a168 |
12 | 252301a6381 |
13 | 112810a1418 |
14 | 7409621041 |
15 | 3db680845d |
hex | 23108d6091 |
150601556113 has 2 divisors, whose sum is σ = 150601556114. Its totient is φ = 150601556112.
The previous prime is 150601556111. The next prime is 150601556117. The reversal of 150601556113 is 311655106051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 149376066064 + 1225490049 = 386492^2 + 35007^2 .
It is a cyclic number.
It is not a de Polignac number, because 150601556113 - 21 = 150601556111 is a prime.
Together with 150601556111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (150601556111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75300778056 + 75300778057.
It is an arithmetic number, because the mean of its divisors is an integer number (75300778057).
Almost surely, 2150601556113 is an apocalyptic number.
It is an amenable number.
150601556113 is a deficient number, since it is larger than the sum of its proper divisors (1).
150601556113 is an equidigital number, since it uses as much as digits as its factorization.
150601556113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 34.
The spelling of 150601556113 in words is "one hundred fifty billion, six hundred one million, five hundred fifty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •