Base | Representation |
---|---|
bin | 111101001001001001… |
… | …0000000000011010111 |
3 | 110112220202011020100011 |
4 | 1322102102000003113 |
5 | 4122402110224343 |
6 | 140153031301051 |
7 | 12325546610662 |
oct | 1722222000327 |
9 | 415822136304 |
10 | 131303211223 |
11 | 5075a26aaa8 |
12 | 2154521a787 |
13 | c4c6b95332 |
14 | 64d85c46d9 |
15 | 363748a29d |
hex | 1e924800d7 |
131303211223 has 4 divisors (see below), whose sum is σ = 131507415928. Its totient is φ = 131099006520.
The previous prime is 131303211217. The next prime is 131303211257. The reversal of 131303211223 is 322112303131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322112303131 = 54799 ⋅5878069.
It is a cyclic number.
It is not a de Polignac number, because 131303211223 - 221 = 131301114071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131303211194 and 131303211203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131300211223) 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, 102101388 + ... + 102102673.
It is an arithmetic number, because the mean of its divisors is an integer number (32876853982).
Almost surely, 2131303211223 is an apocalyptic number.
131303211223 is a deficient number, since it is larger than the sum of its proper divisors (204204705).
131303211223 is an equidigital number, since it uses as much as digits as its factorization.
131303211223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204204704.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 131303211223 its reverse (322112303131), we get a palindrome (453415514354).
The spelling of 131303211223 in words is "one hundred thirty-one billion, three hundred three million, two hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •