Base | Representation |
---|---|
bin | 10011000101000… |
… | …110111010010011 |
3 | 211022100002001122 |
4 | 103011012322103 |
5 | 1123421344011 |
6 | 51432552455 |
7 | 10634600012 |
oct | 2305067223 |
9 | 738302048 |
10 | 320106131 |
11 | 154767524 |
12 | 8b25272b |
13 | 5141a617 |
14 | 30728a79 |
15 | 1d1813db |
hex | 13146e93 |
320106131 has 4 divisors (see below), whose sum is σ = 320146992. Its totient is φ = 320065272.
The previous prime is 320106119. The next prime is 320106169. The reversal of 320106131 is 131601023.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 131601023 = 1193 ⋅110311.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-320106131 is a prime.
It is a super-2 number, since 2×3201061312 = 204935870207578322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (320106191) 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, 4580 + ... + 25713.
It is an arithmetic number, because the mean of its divisors is an integer number (80036748).
Almost surely, 2320106131 is an apocalyptic number.
320106131 is a deficient number, since it is larger than the sum of its proper divisors (40861).
320106131 is a wasteful number, since it uses less digits than its factorization.
320106131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40860.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 320106131 is about 17891.5100257077. The cubic root of 320106131 is about 684.0659875863.
Adding to 320106131 its reverse (131601023), we get a palindrome (451707154).
The spelling of 320106131 in words is "three hundred twenty million, one hundred six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •