Base | Representation |
---|---|
bin | 1100010010100… |
… | …11101010001001 |
3 | 21012000011212211 |
4 | 12021103222021 |
5 | 202343244423 |
6 | 14121505121 |
7 | 2361235111 |
oct | 611235211 |
9 | 235004784 |
10 | 103103113 |
11 | 53220993 |
12 | 2a6421a1 |
13 | 1848c079 |
14 | d99c041 |
15 | 90b910d |
hex | 6253a89 |
103103113 has 8 divisors (see below), whose sum is σ = 109258632. Its totient is φ = 96957696.
The previous prime is 103103107. The next prime is 103103141. The reversal of 103103113 is 311301301.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 17040384 + 86062729 = 4128^2 + 9277^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 103103113 - 25 = 103103081 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103103093 and 103103102.
It is not an unprimeable number, because it can be changed into a prime (103103183) 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, 32431 + ... + 35467.
It is an arithmetic number, because the mean of its divisors is an integer number (13657329).
Almost surely, 2103103113 is an apocalyptic number.
It is an amenable number.
103103113 is a deficient number, since it is larger than the sum of its proper divisors (6155519).
103103113 is a wasteful number, since it uses less digits than its factorization.
103103113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5051.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 103103113 is about 10153.9703072247. The cubic root of 103103113 is about 468.9111856227.
Adding to 103103113 its reverse (311301301), we get a palindrome (414404414).
The spelling of 103103113 in words is "one hundred three million, one hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •