Base | Representation |
---|---|
bin | 111101000011100000… |
… | …0010011110111101111 |
3 | 110112102120011112211221 |
4 | 1322013000103313233 |
5 | 4122010142240211 |
6 | 140122152324211 |
7 | 12321061550665 |
oct | 1720700236757 |
9 | 415376145757 |
10 | 131114024431 |
11 | 506724a3185 |
12 | 214b19a3667 |
13 | c496925aa0 |
14 | 64bb418c35 |
15 | 3625a69c71 |
hex | 1e87013def |
131114024431 has 8 divisors (see below), whose sum is σ = 141229693584. Its totient is φ = 121002637440.
The previous prime is 131114024399. The next prime is 131114024449. The reversal of 131114024431 is 134420411131.
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 131114024431 - 25 = 131114024399 is a prime.
It is a super-2 number, since 2×1311140244312 (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 = 131114024396 and 131114024405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131114024731) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1006801 + ... + 1129546.
It is an arithmetic number, because the mean of its divisors is an integer number (17653711698).
Almost surely, 2131114024431 is an apocalyptic number.
131114024431 is a deficient number, since it is larger than the sum of its proper divisors (10115669153).
131114024431 is a wasteful number, since it uses less digits than its factorization.
131114024431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2141081.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 131114024431 its reverse (134420411131), we get a palindrome (265534435562).
The spelling of 131114024431 in words is "one hundred thirty-one billion, one hundred fourteen million, twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •