Base | Representation |
---|---|
bin | 111101000110011101… |
… | …1000110011100101111 |
3 | 110112200111000101112211 |
4 | 1322030323012130233 |
5 | 4122211102301111 |
6 | 140140100511251 |
7 | 12323405556241 |
oct | 1721473063457 |
9 | 415614011484 |
10 | 131213322031 |
11 | 50713554a10 |
12 | 2151b0ab527 |
13 | c4b138196c |
14 | 64ca6a6091 |
15 | 362e631521 |
hex | 1e8cec672f |
131213322031 has 16 divisors (see below), whose sum is σ = 143869968000. Its totient is φ = 118678788000.
The previous prime is 131213322029. The next prime is 131213322043. The reversal of 131213322031 is 130223312131.
It is a cyclic number.
It is not a de Polignac number, because 131213322031 - 21 = 131213322029 is a prime.
It is a super-2 number, since 2×1312133220312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131213321993 and 131213322011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131213322011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3637120 + ... + 3673018.
It is an arithmetic number, because the mean of its divisors is an integer number (8991873000).
Almost surely, 2131213322031 is an apocalyptic number.
131213322031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
131213322031 is a deficient number, since it is larger than the sum of its proper divisors (12656645969).
131213322031 is a wasteful number, since it uses less digits than its factorization.
131213322031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37590.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 131213322031 its reverse (130223312131), we get a palindrome (261436634162).
The spelling of 131213322031 in words is "one hundred thirty-one billion, two hundred thirteen million, three hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •