Base | Representation |
---|---|
bin | 110000000000101101… |
… | …1100010101001000101 |
3 | 100212010102212211222020 |
4 | 1200001123202221011 |
5 | 3142123410241401 |
6 | 115210455353353 |
7 | 10306664562051 |
oct | 1400133425105 |
9 | 325112784866 |
10 | 103103212101 |
11 | 3a7a90912aa |
12 | 17b95082859 |
13 | 99516c0816 |
14 | 4dc1252c61 |
15 | 2a368b9d36 |
hex | 18016e2a45 |
103103212101 has 4 divisors (see below), whose sum is σ = 137470949472. Its totient is φ = 68735474732.
The previous prime is 103103211997. The next prime is 103103212103. The reversal of 103103212101 is 101212301301.
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, and also an emirpimes, since its reverse is a distinct semiprime: 101212301301 = 3 ⋅33737433767.
It is a cyclic number.
It is not a de Polignac number, because 103103212101 - 210 = 103103211077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103103212103) 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, 17183868681 + ... + 17183868686.
It is an arithmetic number, because the mean of its divisors is an integer number (34367737368).
Almost surely, 2103103212101 is an apocalyptic number.
It is an amenable number.
103103212101 is a deficient number, since it is larger than the sum of its proper divisors (34367737371).
103103212101 is an equidigital number, since it uses as much as digits as its factorization.
103103212101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34367737370.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 103103212101 its reverse (101212301301), we get a palindrome (204315513402).
The spelling of 103103212101 in words is "one hundred three billion, one hundred three million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •