Base | Representation |
---|---|
bin | 1111101000001… |
… | …11110011111001 |
3 | 100010200202212110 |
4 | 13310013303321 |
5 | 232030311433 |
6 | 21002002533 |
7 | 3151236246 |
oct | 764076371 |
9 | 303622773 |
10 | 131103993 |
11 | 68006409 |
12 | 37aa6449 |
13 | 21214137 |
14 | 135aa5cd |
15 | b79a963 |
hex | 7d07cf9 |
131103993 has 4 divisors (see below), whose sum is σ = 174805328. Its totient is φ = 87402660.
The previous prime is 131103967. The next prime is 131104003. The reversal of 131103993 is 399301131.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 131103993 - 25 = 131103961 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 131103993.
It is not an unprimeable number, because it can be changed into a prime (131103923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21850663 + ... + 21850668.
It is an arithmetic number, because the mean of its divisors is an integer number (43701332).
Almost surely, 2131103993 is an apocalyptic number.
It is an amenable number.
131103993 is a deficient number, since it is larger than the sum of its proper divisors (43701335).
131103993 is an equidigital number, since it uses as much as digits as its factorization.
131103993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43701334.
The product of its (nonzero) digits is 2187, while the sum is 30.
The square root of 131103993 is about 11450.0651963209. The cubic root of 131103993 is about 508.0096627939.
The spelling of 131103993 in words is "one hundred thirty-one million, one hundred three thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •