Base | Representation |
---|---|
bin | 111101001001101010… |
… | …1111111001001010111 |
3 | 110112221222200200122012 |
4 | 1322103111333021113 |
5 | 4122421141031203 |
6 | 140154505254435 |
7 | 12326154236255 |
oct | 1722325771127 |
9 | 415858620565 |
10 | 131321033303 |
11 | 50769332a99 |
12 | 2154b19441b |
13 | c4ca795345 |
14 | 64dab035d5 |
15 | 3638d0abd8 |
hex | 1e9357f257 |
131321033303 has 4 divisors (see below), whose sum is σ = 131402753040. Its totient is φ = 131239313568.
The previous prime is 131321033269. The next prime is 131321033309. The reversal of 131321033303 is 303330123131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 303330123131 = 7 ⋅43332874733.
It is a cyclic number.
It is not a de Polignac number, because 131321033303 - 28 = 131321033047 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131321033309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40857458 + ... + 40860671.
It is an arithmetic number, because the mean of its divisors is an integer number (32850688260).
Almost surely, 2131321033303 is an apocalyptic number.
131321033303 is a deficient number, since it is larger than the sum of its proper divisors (81719737).
131321033303 is an equidigital number, since it uses as much as digits as its factorization.
131321033303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81719736.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 131321033303 its reverse (303330123131), we get a palindrome (434651156434).
The spelling of 131321033303 in words is "one hundred thirty-one billion, three hundred twenty-one million, thirty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •