Base | Representation |
---|---|
bin | 110000000000101001… |
… | …1000111000110000001 |
3 | 100212010021201120102211 |
4 | 1200001103013012001 |
5 | 3142122324031423 |
6 | 115210340142121 |
7 | 10306640025664 |
oct | 1400123070601 |
9 | 325107646384 |
10 | 103101002113 |
11 | 3a7a791196a |
12 | 17b94397941 |
13 | 99510c8935 |
14 | 4dc0c396db |
15 | 2a365d010d |
hex | 18014c7181 |
103101002113 has 4 divisors (see below), whose sum is σ = 104163899140. Its totient is φ = 102038105088.
The previous prime is 103101002063. The next prime is 103101002129. The reversal of 103101002113 is 311200101301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 63167774224 + 39933227889 = 251332^2 + 199833^2 .
It is a cyclic number.
It is not a de Polignac number, because 103101002113 - 213 = 103100993921 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103101002093 and 103101002102.
It is not an unprimeable number, because it can be changed into a prime (103101002813) 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, 531448368 + ... + 531448561.
It is an arithmetic number, because the mean of its divisors is an integer number (26040974785).
Almost surely, 2103101002113 is an apocalyptic number.
It is an amenable number.
103101002113 is a deficient number, since it is larger than the sum of its proper divisors (1062897027).
103101002113 is an equidigital number, since it uses as much as digits as its factorization.
103101002113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1062897026.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 103101002113 its reverse (311200101301), we get a palindrome (414301103414).
The spelling of 103101002113 in words is "one hundred three billion, one hundred one million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •