Base | Representation |
---|---|
bin | 111101000000001111… |
… | …0101011100001101011 |
3 | 110112010221011102111001 |
4 | 1322000132223201223 |
5 | 4121244130421011 |
6 | 140103242015431 |
7 | 12315262155235 |
oct | 1720036534153 |
9 | 415127142431 |
10 | 131004545131 |
11 | 50616717819 |
12 | 214811a7577 |
13 | c47a043735 |
14 | 64aaa7b255 |
15 | 361b1417c1 |
hex | 1e807ab86b |
131004545131 has 2 divisors, whose sum is σ = 131004545132. Its totient is φ = 131004545130.
The previous prime is 131004545129. The next prime is 131004545143. The reversal of 131004545131 is 131545400131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131004545131 - 21 = 131004545129 is a prime.
It is a super-2 number, since 2×1310045451312 (a number of 23 digits) contains 22 as substring.
Together with 131004545129, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 131004545131.
It is not a weakly prime, because it can be changed into another prime (131004545531) 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, 65502272565 + 65502272566.
It is an arithmetic number, because the mean of its divisors is an integer number (65502272566).
Almost surely, 2131004545131 is an apocalyptic number.
131004545131 is a deficient number, since it is larger than the sum of its proper divisors (1).
131004545131 is an equidigital number, since it uses as much as digits as its factorization.
131004545131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 131004545131 its reverse (131545400131), we get a palindrome (262549945262).
The spelling of 131004545131 in words is "one hundred thirty-one billion, four million, five hundred forty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •