Base | Representation |
---|---|
bin | 110000000000111100… |
… | …1101000111100010111 |
3 | 100212010222201201012021 |
4 | 1200001321220330113 |
5 | 3142132420232411 |
6 | 115211340434011 |
7 | 10310121623254 |
oct | 1400171507427 |
9 | 325128651167 |
10 | 103111102231 |
11 | 3a802590275 |
12 | 17b97848907 |
13 | 9953223c37 |
14 | 4dc230842b |
15 | 2a37427a71 |
hex | 1801e68f17 |
103111102231 has 4 divisors (see below), whose sum is σ = 103115246272. Its totient is φ = 103106958192.
The previous prime is 103111102189. The next prime is 103111102243. The reversal of 103111102231 is 132201111301.
It is a happy number.
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 103111102231 - 27 = 103111102103 is a prime.
It is a super-2 number, since 2×1031111022312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103111102291) 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, 2034471 + ... + 2084536.
It is an arithmetic number, because the mean of its divisors is an integer number (25778811568).
Almost surely, 2103111102231 is an apocalyptic number.
103111102231 is a deficient number, since it is larger than the sum of its proper divisors (4144041).
103111102231 is an equidigital number, since it uses as much as digits as its factorization.
103111102231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4144040.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 103111102231 its reverse (132201111301), we get a palindrome (235312213532).
The spelling of 103111102231 in words is "one hundred three billion, one hundred eleven million, one hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •