Base | Representation |
---|---|
bin | 1000110110000111000… |
… | …0000010101010101111 |
3 | 112112020121202212201221 |
4 | 2031201300002222233 |
5 | 4442210220323101 |
6 | 153451120244211 |
7 | 13656543214555 |
oct | 2154160025257 |
9 | 475217685657 |
10 | 151963839151 |
11 | 594a1697613 |
12 | 25550470667 |
13 | 1143a3a5567 |
14 | 74d8515bd5 |
15 | 3e461ecaa1 |
hex | 2361c02aaf |
151963839151 has 2 divisors, whose sum is σ = 151963839152. Its totient is φ = 151963839150.
The previous prime is 151963839133. The next prime is 151963839253. The reversal of 151963839151 is 151938369151.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 151963839151 - 233 = 143373904559 is a prime.
It is a super-2 number, since 2×1519638391512 (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 (151963839101) 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, 75981919575 + 75981919576.
It is an arithmetic number, because the mean of its divisors is an integer number (75981919576).
Almost surely, 2151963839151 is an apocalyptic number.
151963839151 is a deficient number, since it is larger than the sum of its proper divisors (1).
151963839151 is an equidigital number, since it uses as much as digits as its factorization.
151963839151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 874800, while the sum is 52.
The spelling of 151963839151 in words is "one hundred fifty-one billion, nine hundred sixty-three million, eight hundred thirty-nine thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •