Base | Representation |
---|---|
bin | 1000110111101010000… |
… | …1001010001011100001 |
3 | 112120022120122221101021 |
4 | 2031322201022023201 |
5 | 4444033104240121 |
6 | 154000242405441 |
7 | 14003050154446 |
oct | 2157241121341 |
9 | 476276587337 |
10 | 152379368161 |
11 | 596951a9719 |
12 | 25647660881 |
13 | 114a54c3207 |
14 | 753779d9cd |
15 | 3e6c92c641 |
hex | 237a84a2e1 |
152379368161 has 2 divisors, whose sum is σ = 152379368162. Its totient is φ = 152379368160.
The previous prime is 152379368143. The next prime is 152379368171. The reversal of 152379368161 is 161863973251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106965627136 + 45413741025 = 327056^2 + 213105^2 .
It is a cyclic number.
It is not a de Polignac number, because 152379368161 - 27 = 152379368033 is a prime.
It is a super-2 number, since 2×1523793681612 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 152379368099 and 152379368108.
It is not a weakly prime, because it can be changed into another prime (152379368171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76189684080 + 76189684081.
It is an arithmetic number, because the mean of its divisors is an integer number (76189684081).
Almost surely, 2152379368161 is an apocalyptic number.
It is an amenable number.
152379368161 is a deficient number, since it is larger than the sum of its proper divisors (1).
152379368161 is an equidigital number, since it uses as much as digits as its factorization.
152379368161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1632960, while the sum is 52.
The spelling of 152379368161 in words is "one hundred fifty-two billion, three hundred seventy-nine million, three hundred sixty-eight thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •