Base | Representation |
---|---|
bin | 111101001101010100… |
… | …0100100001010011111 |
3 | 110120021111211201102011 |
4 | 1322122220210022133 |
5 | 4123143444002111 |
6 | 140214555012051 |
7 | 12332200663306 |
oct | 1723250441237 |
9 | 416244751364 |
10 | 131443344031 |
11 | 5082138293a |
12 | 2158413a027 |
13 | c519c1ac5c |
14 | 650d06143d |
15 | 364491b021 |
hex | 1e9aa2429f |
131443344031 has 2 divisors, whose sum is σ = 131443344032. Its totient is φ = 131443344030.
The previous prime is 131443343981. The next prime is 131443344049. The reversal of 131443344031 is 130443344131.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131443344031 - 29 = 131443343519 is a prime.
It is a super-2 number, since 2×1314433440312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131443343984 and 131443344002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131443344731) 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, 65721672015 + 65721672016.
It is an arithmetic number, because the mean of its divisors is an integer number (65721672016).
Almost surely, 2131443344031 is an apocalyptic number.
131443344031 is a deficient number, since it is larger than the sum of its proper divisors (1).
131443344031 is an equidigital number, since it uses as much as digits as its factorization.
131443344031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 131443344031 its reverse (130443344131), we get a palindrome (261886688162).
The spelling of 131443344031 in words is "one hundred thirty-one billion, four hundred forty-three million, three hundred forty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •