Base | Representation |
---|---|
bin | 10000000011011100101… |
… | …000110011010000100101 |
3 | 10220110120211110212202202 |
4 | 100003130220303100211 |
5 | 121033340101423023 |
6 | 2202450441544245 |
7 | 142463440264142 |
oct | 20033450632045 |
9 | 3813524425682 |
10 | 1103213311013 |
11 | 395963176130 |
12 | 159987aa5085 |
13 | 80056727738 |
14 | 3b5781593c9 |
15 | 1da6cb2d128 |
hex | 100dca33425 |
1103213311013 has 12 divisors (see below), whose sum is σ = 1258106817408. Its totient is φ = 959315917560.
The previous prime is 1103213311009. The next prime is 1103213311043. The reversal of 1103213311013 is 3101133123011.
It is not a de Polignac number, because 1103213311013 - 22 = 1103213311009 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103213311043) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 94788245 + ... + 94799882.
It is an arithmetic number, because the mean of its divisors is an integer number (104842234784).
Almost surely, 21103213311013 is an apocalyptic number.
It is an amenable number.
1103213311013 is a deficient number, since it is larger than the sum of its proper divisors (154893506395).
1103213311013 is a wasteful number, since it uses less digits than its factorization.
1103213311013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189588184 (or 189588161 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1103213311013 its reverse (3101133123011), we get a palindrome (4204346434024).
The spelling of 1103213311013 in words is "one trillion, one hundred three billion, two hundred thirteen million, three hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •