Base | Representation |
---|---|
bin | 1111100111101… |
… | …00000100011101 |
3 | 100010112122221122 |
4 | 13303310010131 |
5 | 232020220013 |
6 | 21000140325 |
7 | 3150451433 |
oct | 763640435 |
9 | 303478848 |
10 | 131023133 |
11 | 67a6068a |
12 | 37a676a5 |
13 | 211b63a7 |
14 | 13588d53 |
15 | b781a08 |
hex | 7cf411d |
131023133 has 4 divisors (see below), whose sum is σ = 131066940. Its totient is φ = 130979328.
The previous prime is 131023127. The next prime is 131023147. The reversal of 131023133 is 331320131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 61183684 + 69839449 = 7822^2 + 8357^2 .
It is a cyclic number.
It is not a de Polignac number, because 131023133 - 24 = 131023117 is a prime.
It is a super-2 number, since 2×1310231332 = 34334122762271378, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131023103) 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, 17060 + ... + 23517.
It is an arithmetic number, because the mean of its divisors is an integer number (32766735).
Almost surely, 2131023133 is an apocalyptic number.
It is an amenable number.
131023133 is a deficient number, since it is larger than the sum of its proper divisors (43807).
131023133 is an equidigital number, since it uses as much as digits as its factorization.
131023133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43806.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 131023133 is about 11446.5336674471. The cubic root of 131023133 is about 507.9052009125.
Adding to 131023133 its reverse (331320131), we get a palindrome (462343264).
The spelling of 131023133 in words is "one hundred thirty-one million, twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.214 sec. • engine limits •