Base | Representation |
---|---|
bin | 110000000000111011… |
… | …0010010010011111101 |
3 | 100212010221002001020220 |
4 | 1200001312102103331 |
5 | 3142132204114401 |
6 | 115211305531553 |
7 | 10310111302224 |
oct | 1400166222375 |
9 | 325127061226 |
10 | 103110223101 |
11 | 3a80203a816 |
12 | 17b974a3bb9 |
13 | 9952ca6a42 |
14 | 4dc2159cbb |
15 | 2a37302336 |
hex | 1801d924fd |
103110223101 has 4 divisors (see below), whose sum is σ = 137480297472. Its totient is φ = 68740148732.
The previous prime is 103110223061. The next prime is 103110223187. The reversal of 103110223101 is 101322011301.
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 103110223101 - 27 = 103110222973 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103110223201) 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, 17185037181 + ... + 17185037186.
It is an arithmetic number, because the mean of its divisors is an integer number (34370074368).
Almost surely, 2103110223101 is an apocalyptic number.
It is an amenable number.
103110223101 is a deficient number, since it is larger than the sum of its proper divisors (34370074371).
103110223101 is an equidigital number, since it uses as much as digits as its factorization.
103110223101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34370074370.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 103110223101 its reverse (101322011301), we get a palindrome (204432234402).
The spelling of 103110223101 in words is "one hundred three billion, one hundred ten million, two hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •