Base | Representation |
---|---|
bin | 110000000000101101… |
… | …1001010011100110101 |
3 | 100212010102200211001022 |
4 | 1200001123022130311 |
5 | 3142123344104023 |
6 | 115210453310525 |
7 | 10306664000135 |
oct | 1400133123465 |
9 | 325112624038 |
10 | 103103113013 |
11 | 3a7a902390a |
12 | 17b95035445 |
13 | 99516876a4 |
14 | 4dc1228ac5 |
15 | 2a3689a7c8 |
hex | 18016ca735 |
103103113013 has 4 divisors (see below), whose sum is σ = 103438954080. Its totient is φ = 102767271948.
The previous prime is 103103112961. The next prime is 103103113037. The reversal of 103103113013 is 310311301301.
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.
It is a cyclic number.
It is not a de Polignac number, because 103103113013 - 210 = 103103111989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103103112982 and 103103113000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103103113213) 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, 167920073 + ... + 167920686.
It is an arithmetic number, because the mean of its divisors is an integer number (25859738520).
Almost surely, 2103103113013 is an apocalyptic number.
It is an amenable number.
103103113013 is a deficient number, since it is larger than the sum of its proper divisors (335841067).
103103113013 is an equidigital number, since it uses as much as digits as its factorization.
103103113013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 335841066.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 103103113013 its reverse (310311301301), we get a palindrome (413414414314).
The spelling of 103103113013 in words is "one hundred three billion, one hundred three million, one hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •