Base | Representation |
---|---|
bin | 10000000010011010111… |
… | …001001110110101011101 |
3 | 10220100201222000020022022 |
4 | 100002122321032311131 |
5 | 121024110220301023 |
6 | 2202145201025525 |
7 | 142424215111601 |
oct | 20023271166535 |
9 | 3810658006268 |
10 | 1102110322013 |
11 | 3954475aa178 |
12 | 15971a6252a5 |
13 | 7cc0c06b41c |
14 | 3b4b187d501 |
15 | 1da05da67c8 |
hex | 1009ae4ed5d |
1102110322013 has 16 divisors (see below), whose sum is σ = 1108509103296. Its totient is φ = 1095736118400.
The previous prime is 1102110322009. The next prime is 1102110322043. The reversal of 1102110322013 is 3102230112011.
It is a cyclic number.
It is not a de Polignac number, because 1102110322013 - 22 = 1102110322009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102110321982 and 1102110322000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102110322043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 162958370 + ... + 162965132.
It is an arithmetic number, because the mean of its divisors is an integer number (69281818956).
Almost surely, 21102110322013 is an apocalyptic number.
It is an amenable number.
1102110322013 is a deficient number, since it is larger than the sum of its proper divisors (6398781283).
1102110322013 is an equidigital number, since it uses as much as digits as its factorization.
1102110322013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8444.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1102110322013 its reverse (3102230112011), we get a palindrome (4204340434024).
The spelling of 1102110322013 in words is "one trillion, one hundred two billion, one hundred ten million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •