Base | Representation |
---|---|
bin | 1111100111111… |
… | …11000010111101 |
3 | 100010121221121211 |
4 | 13303333002331 |
5 | 232023134333 |
6 | 21001124421 |
7 | 3151026502 |
oct | 763770275 |
9 | 303557554 |
10 | 131068093 |
11 | 67a91442 |
12 | 37a89711 |
13 | 212009b0 |
14 | 1359b4a9 |
15 | b78eecd |
hex | 7cff0bd |
131068093 has 8 divisors (see below), whose sum is σ = 145703936. Its totient is φ = 117082800.
The previous prime is 131068051. The next prime is 131068109. The reversal of 131068093 is 390860131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131068093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131068043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 162213 + ... + 163018.
It is an arithmetic number, because the mean of its divisors is an integer number (18212992).
Almost surely, 2131068093 is an apocalyptic number.
131068093 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
131068093 is a deficient number, since it is larger than the sum of its proper divisors (14635843).
131068093 is a wasteful number, since it uses less digits than its factorization.
131068093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325275.
The product of its (nonzero) digits is 3888, while the sum is 31.
The square root of 131068093 is about 11448.4974123245. The cubic root of 131068093 is about 507.9632893988.
The spelling of 131068093 in words is "one hundred thirty-one million, sixty-eight thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •