Base | Representation |
---|---|
bin | 1100010010111… |
… | …00111011111001 |
3 | 21012002010000020 |
4 | 12021130323321 |
5 | 202401003423 |
6 | 14122401053 |
7 | 2361453645 |
oct | 611347371 |
9 | 235063006 |
10 | 103141113 |
11 | 53247499 |
12 | 2a660189 |
13 | 184a345a |
14 | d9abc25 |
15 | 90c54e3 |
hex | 625cef9 |
103141113 has 4 divisors (see below), whose sum is σ = 137521488. Its totient is φ = 68760740.
The previous prime is 103141097. The next prime is 103141229. The reversal of 103141113 is 311141301.
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, and also an emirpimes, since its reverse is a distinct semiprime: 311141301 = 3 ⋅103713767.
It is a cyclic number.
It is not a de Polignac number, because 103141113 - 24 = 103141097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103141092 and 103141101.
It is not an unprimeable number, because it can be changed into a prime (103141013) 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, 17190183 + ... + 17190188.
It is an arithmetic number, because the mean of its divisors is an integer number (34380372).
Almost surely, 2103141113 is an apocalyptic number.
It is an amenable number.
103141113 is a deficient number, since it is larger than the sum of its proper divisors (34380375).
103141113 is an equidigital number, since it uses as much as digits as its factorization.
103141113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34380374.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 103141113 is about 10155.8413240854. The cubic root of 103141113 is about 468.9687863291.
Adding to 103141113 its reverse (311141301), we get a palindrome (414282414).
The spelling of 103141113 in words is "one hundred three million, one hundred forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •