Base | Representation |
---|---|
bin | 111101000110011001… |
… | …0010100111110010111 |
3 | 110112200022200112211001 |
4 | 1322030302110332113 |
5 | 4122210010202411 |
6 | 140135535324131 |
7 | 12323350200262 |
oct | 1721462247627 |
9 | 415608615731 |
10 | 131211022231 |
11 | 50712224053 |
12 | 2151a380647 |
13 | c4b0a57c33 |
14 | 64ca267cd9 |
15 | 362e329dc1 |
hex | 1e8cc94f97 |
131211022231 has 4 divisors (see below), whose sum is σ = 131217790864. Its totient is φ = 131204253600.
The previous prime is 131211022177. The next prime is 131211022279. The reversal of 131211022231 is 132220112131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 131211022231 - 29 = 131211021719 is a prime.
It is a super-2 number, since 2×1312110222312 (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 = 131211022199 and 131211022208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131211028231) 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, 3355155 + ... + 3394036.
It is an arithmetic number, because the mean of its divisors is an integer number (32804447716).
Almost surely, 2131211022231 is an apocalyptic number.
131211022231 is a deficient number, since it is larger than the sum of its proper divisors (6768633).
131211022231 is an equidigital number, since it uses as much as digits as its factorization.
131211022231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6768632.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 131211022231 its reverse (132220112131), we get a palindrome (263431134362).
The spelling of 131211022231 in words is "one hundred thirty-one billion, two hundred eleven million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •