Base | Representation |
---|---|
bin | 110000000001010011… |
… | …1011101010011111011 |
3 | 100212011211022221011101 |
4 | 1200002213131103323 |
5 | 3142144004110321 |
6 | 115212450112231 |
7 | 10310325666556 |
oct | 1400247352373 |
9 | 325154287141 |
10 | 103123113211 |
11 | 3a8093442a8 |
12 | 17b9b87b677 |
13 | 995586ac21 |
14 | 4dc3b5369d |
15 | 2a384eb791 |
hex | 18029dd4fb |
103123113211 has 4 divisors (see below), whose sum is σ = 109189178712. Its totient is φ = 97057047712.
The previous prime is 103123113173. The next prime is 103123113229. The reversal of 103123113211 is 112311321301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 112311321301 = 199 ⋅564378499.
It is a cyclic number.
It is not a de Polignac number, because 103123113211 - 215 = 103123080443 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103123113011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3033032725 + ... + 3033032758.
It is an arithmetic number, because the mean of its divisors is an integer number (27297294678).
Almost surely, 2103123113211 is an apocalyptic number.
103123113211 is a deficient number, since it is larger than the sum of its proper divisors (6066065501).
103123113211 is an equidigital number, since it uses as much as digits as its factorization.
103123113211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6066065500.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 103123113211 its reverse (112311321301), we get a palindrome (215434434512).
The spelling of 103123113211 in words is "one hundred three billion, one hundred twenty-three million, one hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •