Base | Representation |
---|---|
bin | 111101000000110011… |
… | …0010101111010000111 |
3 | 110112012020111211210011 |
4 | 1322001212111322013 |
5 | 4121313433042301 |
6 | 140105152411051 |
7 | 12315610636342 |
oct | 1720146257207 |
9 | 415166454704 |
10 | 131023330951 |
11 | 50626288897 |
12 | 21487546a87 |
13 | c480bc02c6 |
14 | 64ad36b459 |
15 | 361cb02a51 |
hex | 1e81995e87 |
131023330951 has 2 divisors, whose sum is σ = 131023330952. Its totient is φ = 131023330950.
The previous prime is 131023330931. The next prime is 131023331017. The reversal of 131023330951 is 159033320131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131023330951 - 215 = 131023298183 is a prime.
It is a super-2 number, since 2×1310233309512 (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 (131023330931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65511665475 + 65511665476.
It is an arithmetic number, because the mean of its divisors is an integer number (65511665476).
Almost surely, 2131023330951 is an apocalyptic number.
131023330951 is a deficient number, since it is larger than the sum of its proper divisors (1).
131023330951 is an equidigital number, since it uses as much as digits as its factorization.
131023330951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7290, while the sum is 31.
The spelling of 131023330951 in words is "one hundred thirty-one billion, twenty-three million, three hundred thirty thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •