Base | Representation |
---|---|
bin | 110000000011111011… |
… | …1100001110110110011 |
3 | 100212101222002211021022 |
4 | 1200013313201312303 |
5 | 3142334032242321 |
6 | 115225314250055 |
7 | 10312445554142 |
oct | 1400767416663 |
9 | 325358084238 |
10 | 103211212211 |
11 | 3a854047398 |
12 | 1800528692b |
13 | 996aba5803 |
14 | 4dd1727759 |
15 | 2a410eedab |
hex | 1807de1db3 |
103211212211 has 4 divisors (see below), whose sum is σ = 103248381432. Its totient is φ = 103174042992.
The previous prime is 103211212129. The next prime is 103211212241. The reversal of 103211212211 is 112212112301.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 112212112301 = 43 ⋅2609584007.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103211212211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103211212211.
It is not an unprimeable number, because it can be changed into a prime (103211212241) 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, 18580445 + ... + 18585998.
It is an arithmetic number, because the mean of its divisors is an integer number (25812095358).
Almost surely, 2103211212211 is an apocalyptic number.
103211212211 is a deficient number, since it is larger than the sum of its proper divisors (37169221).
103211212211 is an equidigital number, since it uses as much as digits as its factorization.
103211212211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37169220.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 103211212211 its reverse (112212112301), we get a palindrome (215423324512).
The spelling of 103211212211 in words is "one hundred three billion, two hundred eleven million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •