Base | Representation |
---|---|
bin | 1000110000101101110… |
… | …1100011001101101111 |
3 | 112101111201200201010212 |
4 | 2030023131203031233 |
5 | 4431224113314101 |
6 | 153051323253035 |
7 | 13605634114052 |
oct | 2141335431557 |
9 | 471451621125 |
10 | 150516151151 |
11 | 58919497153 |
12 | 2520767a17b |
13 | 1126949ab42 |
14 | 73dc14ca99 |
15 | 3dae0881bb |
hex | 230b76336f |
150516151151 has 2 divisors, whose sum is σ = 150516151152. Its totient is φ = 150516151150.
The previous prime is 150516151099. The next prime is 150516151171. The reversal of 150516151151 is 151151615051.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 150516151151 - 230 = 149442409327 is a prime.
It is a super-2 number, since 2×1505161511512 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150516151171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75258075575 + 75258075576.
It is an arithmetic number, because the mean of its divisors is an integer number (75258075576).
Almost surely, 2150516151151 is an apocalyptic number.
150516151151 is a deficient number, since it is larger than the sum of its proper divisors (1).
150516151151 is an equidigital number, since it uses as much as digits as its factorization.
150516151151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3750, while the sum is 32.
The spelling of 150516151151 in words is "one hundred fifty billion, five hundred sixteen million, one hundred fifty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •