Base | Representation |
---|---|
bin | 10000000011010110000… |
… | …000001110101001110111 |
3 | 10220110022002001022020221 |
4 | 100003112000032221313 |
5 | 121033123103341043 |
6 | 2202431424235211 |
7 | 142460616252244 |
oct | 20032600165167 |
9 | 3813262038227 |
10 | 1103102012023 |
11 | 3959063675a0 |
12 | 15995676bb07 |
13 | 8003965904b |
14 | 3b5674665cb |
15 | 1da62e958ed |
hex | 100d600ea77 |
1103102012023 has 8 divisors (see below), whose sum is σ = 1203393856896. Its totient is φ = 1002811807800.
The previous prime is 1103102012017. The next prime is 1103102012039. The reversal of 1103102012023 is 3202102013011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1103102012023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1103102011988 and 1103102012006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103102012053) 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 7 ways as a sum of consecutive naturals, for example, 1308990 + ... + 1979812.
It is an arithmetic number, because the mean of its divisors is an integer number (150424232112).
Almost surely, 21103102012023 is an apocalyptic number.
1103102012023 is a deficient number, since it is larger than the sum of its proper divisors (100291844873).
1103102012023 is a wasteful number, since it uses less digits than its factorization.
1103102012023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820325.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1103102012023 its reverse (3202102013011), we get a palindrome (4305204025034).
The spelling of 1103102012023 in words is "one trillion, one hundred three billion, one hundred two million, twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •