Base | Representation |
---|---|
bin | 111101000000001100… |
… | …1111100100111101111 |
3 | 110112010211211101120012 |
4 | 1322000121330213233 |
5 | 4121243321220211 |
6 | 140103155243435 |
7 | 12315245500106 |
oct | 1720031744757 |
9 | 415124741505 |
10 | 131003304431 |
11 | 50615a4a64a |
12 | 214808a957b |
13 | c4799caaac |
14 | 64aa83703d |
15 | 361ae98d8b |
hex | 1e8067c9ef |
131003304431 has 4 divisors (see below), whose sum is σ = 131182027272. Its totient is φ = 130824581592.
The previous prime is 131003304379. The next prime is 131003304451. The reversal of 131003304431 is 134403300131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131003304431 is a prime.
It is a super-2 number, since 2×1310033044312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131003304397 and 131003304406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131003304451) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 89360321 + ... + 89361786.
It is an arithmetic number, because the mean of its divisors is an integer number (32795506818).
Almost surely, 2131003304431 is an apocalyptic number.
131003304431 is a deficient number, since it is larger than the sum of its proper divisors (178722841).
131003304431 is an equidigital number, since it uses as much as digits as its factorization.
131003304431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178722840.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 131003304431 its reverse (134403300131), we get a palindrome (265406604562).
The spelling of 131003304431 in words is "one hundred thirty-one billion, three million, three hundred four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •