Base | Representation |
---|---|
bin | 110000000001001101… |
… | …1111101111101011101 |
3 | 100212011121122220110220 |
4 | 1200002123331331131 |
5 | 3142142221214323 |
6 | 115212301351553 |
7 | 10310261253333 |
oct | 1400233757535 |
9 | 325147586426 |
10 | 103120101213 |
11 | 3a807677348 |
12 | 17b9a8685b9 |
13 | 9955054c8c |
14 | 4dc35abb53 |
15 | 2a381040e3 |
hex | 18026fdf5d |
103120101213 has 4 divisors (see below), whose sum is σ = 137493468288. Its totient is φ = 68746734140.
The previous prime is 103120101197. The next prime is 103120101239. The reversal of 103120101213 is 312101021301.
It is a happy number.
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 103120101213 - 24 = 103120101197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103120101192 and 103120101201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103120101013) 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, 17186683533 + ... + 17186683538.
It is an arithmetic number, because the mean of its divisors is an integer number (34373367072).
Almost surely, 2103120101213 is an apocalyptic number.
It is an amenable number.
103120101213 is a deficient number, since it is larger than the sum of its proper divisors (34373367075).
103120101213 is an equidigital number, since it uses as much as digits as its factorization.
103120101213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34373367074.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 103120101213 its reverse (312101021301), we get a palindrome (415221122514).
The spelling of 103120101213 in words is "one hundred three billion, one hundred twenty million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •