Base | Representation |
---|---|
bin | 110000000000101101… |
… | …1100010011011010111 |
3 | 100212010102212210202201 |
4 | 1200001123202123113 |
5 | 3142123410224343 |
6 | 115210455345331 |
7 | 10306664556355 |
oct | 1400133423327 |
9 | 325112783681 |
10 | 103103211223 |
11 | 3a7a9090681 |
12 | 17b95082247 |
13 | 99516c02bc |
14 | 4dc12527d5 |
15 | 2a368b994d |
hex | 18016e26d7 |
103103211223 has 4 divisors (see below), whose sum is σ = 103224083368. Its totient is φ = 102982339080.
The previous prime is 103103211217. The next prime is 103103211247. The reversal of 103103211223 is 322112301301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103103211223 - 217 = 103103080151 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 103103211223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103103211623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60434793 + ... + 60436498.
It is an arithmetic number, because the mean of its divisors is an integer number (25806020842).
Almost surely, 2103103211223 is an apocalyptic number.
103103211223 is a deficient number, since it is larger than the sum of its proper divisors (120872145).
103103211223 is an equidigital number, since it uses as much as digits as its factorization.
103103211223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120872144.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103103211223 its reverse (322112301301), we get a palindrome (425215512524).
The spelling of 103103211223 in words is "one hundred three billion, one hundred three million, two hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •