Base | Representation |
---|---|
bin | 111101000000101101… |
… | …0011100100011001111 |
3 | 110112012000122101222102 |
4 | 1322001122130203033 |
5 | 4121312133244211 |
6 | 140105001505315 |
7 | 12315542300423 |
oct | 1720132344317 |
9 | 415160571872 |
10 | 131020212431 |
11 | 506245488a9 |
12 | 214864a223b |
13 | c48036aa24 |
14 | 64acb98b83 |
15 | 361c6d8a3b |
hex | 1e8169c8cf |
131020212431 has 8 divisors (see below), whose sum is σ = 131555417760. Its totient is φ = 130485953632.
The previous prime is 131020212397. The next prime is 131020212467. The reversal of 131020212431 is 134212020131.
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 131020212431 - 218 = 131019950287 is a prime.
It is a super-2 number, since 2×1310202124312 (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 (131020212481) 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, 41441 + ... + 513573.
It is an arithmetic number, because the mean of its divisors is an integer number (16444427220).
Almost surely, 2131020212431 is an apocalyptic number.
131020212431 is a deficient number, since it is larger than the sum of its proper divisors (535205329).
131020212431 is an equidigital number, since it uses as much as digits as its factorization.
131020212431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473265.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 131020212431 its reverse (134212020131), we get a palindrome (265232232562).
The spelling of 131020212431 in words is "one hundred thirty-one billion, twenty million, two hundred twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •