Base | Representation |
---|---|
bin | 110000000000111101… |
… | …0000000110100001101 |
3 | 100212010222220200022211 |
4 | 1200001322000310031 |
5 | 3142132431400023 |
6 | 115211342510421 |
7 | 10310122511323 |
oct | 1400172006415 |
9 | 325128820284 |
10 | 103111200013 |
11 | 3a802647788 |
12 | 17b97895411 |
13 | 99532595b3 |
14 | 4dc2331d13 |
15 | 2a37446a0d |
hex | 1801e80d0d |
103111200013 has 8 divisors (see below), whose sum is σ = 103440571776. Its totient is φ = 102782246400.
The previous prime is 103111199999. The next prime is 103111200029. The reversal of 103111200013 is 310002111301.
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 103111200013 - 217 = 103111068941 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103111199966 and 103111200002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103111200083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 393198 + ... + 600688.
It is an arithmetic number, because the mean of its divisors is an integer number (12930071472).
Almost surely, 2103111200013 is an apocalyptic number.
It is an amenable number.
103111200013 is a deficient number, since it is larger than the sum of its proper divisors (329371763).
103111200013 is a wasteful number, since it uses less digits than its factorization.
103111200013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209075.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 103111200013 its reverse (310002111301), we get a palindrome (413113311314).
The spelling of 103111200013 in words is "one hundred three billion, one hundred eleven million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •