Base | Representation |
---|---|
bin | 111101000000001001… |
… | …0010110101110110111 |
3 | 110112010201002021112002 |
4 | 1322000102112232313 |
5 | 4121242314023411 |
6 | 140103044445515 |
7 | 12315222540554 |
oct | 1720022265667 |
9 | 415121067462 |
10 | 131001314231 |
11 | 50614910357 |
12 | 214800a989b |
13 | c479481c68 |
14 | 64aa479a2b |
15 | 361ac0433b |
hex | 1e80496bb7 |
131001314231 has 8 divisors (see below), whose sum is σ = 132496846560. Its totient is φ = 129506306688.
The previous prime is 131001314189. The next prime is 131001314233. The reversal of 131001314231 is 132413100131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131001314231 - 210 = 131001313207 is a prime.
It is a super-2 number, since 2×1310013142312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131001314233) 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 in 7 ways as a sum of consecutive naturals, for example, 382310 + ... + 638876.
It is an arithmetic number, because the mean of its divisors is an integer number (16562105820).
Almost surely, 2131001314231 is an apocalyptic number.
131001314231 is a deficient number, since it is larger than the sum of its proper divisors (1495532329).
131001314231 is an equidigital number, since it uses as much as digits as its factorization.
131001314231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262393.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 131001314231 its reverse (132413100131), we get a palindrome (263414414362).
The spelling of 131001314231 in words is "one hundred thirty-one billion, one million, three hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •