Base | Representation |
---|---|
bin | 1000110011000000011… |
… | …1000110000000000001 |
3 | 112110002120200100102211 |
4 | 2030300013012000001 |
5 | 4434004020140223 |
6 | 153232330142121 |
7 | 13630111325326 |
oct | 2146007060001 |
9 | 473076610384 |
10 | 151131021313 |
11 | 59104581208 |
12 | 25359581941 |
13 | 113369a1c3c |
14 | 7459a86b4d |
15 | 3de8041d0d |
hex | 23301c6001 |
151131021313 has 2 divisors, whose sum is σ = 151131021314. Its totient is φ = 151131021312.
The previous prime is 151131021277. The next prime is 151131021323. The reversal of 151131021313 is 313120131151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 147603492864 + 3527528449 = 384192^2 + 59393^2 .
It is a cyclic number.
It is not a de Polignac number, because 151131021313 - 225 = 151097466881 is a prime.
It is a super-2 number, since 2×1511310213132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (151131021323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75565510656 + 75565510657.
It is an arithmetic number, because the mean of its divisors is an integer number (75565510657).
Almost surely, 2151131021313 is an apocalyptic number.
It is an amenable number.
151131021313 is a deficient number, since it is larger than the sum of its proper divisors (1).
151131021313 is an equidigital number, since it uses as much as digits as its factorization.
151131021313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 22.
Adding to 151131021313 its reverse (313120131151), we get a palindrome (464251152464).
The spelling of 151131021313 in words is "one hundred fifty-one billion, one hundred thirty-one million, twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •