Base | Representation |
---|---|
bin | 10011000101000… |
… | …111111000111101 |
3 | 211022100021120011 |
4 | 103011013320331 |
5 | 1123422011031 |
6 | 51433023221 |
7 | 10634614501 |
oct | 2305077075 |
9 | 738307504 |
10 | 320110141 |
11 | 15476a53a |
12 | 8b254b11 |
13 | 5141c3b0 |
14 | 3072a301 |
15 | 1d1826b1 |
hex | 13147e3d |
320110141 has 8 divisors (see below), whose sum is σ = 344907864. Its totient is φ = 295337280.
The previous prime is 320110117. The next prime is 320110151. The reversal of 320110141 is 141011023.
It can be written as a sum of positive squares in 4 ways, for example, as 11088900 + 309021241 = 3330^2 + 17579^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 320110141 - 223 = 311721533 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320110111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27231 + ... + 37171.
It is an arithmetic number, because the mean of its divisors is an integer number (43113483).
Almost surely, 2320110141 is an apocalyptic number.
It is an amenable number.
320110141 is a deficient number, since it is larger than the sum of its proper divisors (24797723).
320110141 is a wasteful number, since it uses less digits than its factorization.
320110141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12431.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 320110141 is about 17891.6220896821. The cubic root of 320110141 is about 684.0688440277.
Adding to 320110141 its reverse (141011023), we get a palindrome (461121164).
The spelling of 320110141 in words is "three hundred twenty million, one hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •