Base | Representation |
---|---|
bin | 10000000010011010011… |
… | …110100100010100010001 |
3 | 10220100201110212002222010 |
4 | 100002122132210110101 |
5 | 121024101423111423 |
6 | 2202144351133133 |
7 | 142424101520100 |
oct | 20023236442421 |
9 | 3810643762863 |
10 | 1102103332113 |
11 | 3954436655a3 |
12 | 1597182141a9 |
13 | 7cc0a7919a4 |
14 | 3b4b0980037 |
15 | 1da05475693 |
hex | 1009a7a4511 |
1102103332113 has 24 divisors (see below), whose sum is σ = 1709430784320. Its totient is φ = 629756376480.
The previous prime is 1102103332069. The next prime is 1102103332181. The reversal of 1102103332113 is 3112333012011.
It is a happy number.
It is not a de Polignac number, because 1102103332113 - 26 = 1102103332049 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1102103332113.
It is not an unprimeable number, because it can be changed into a prime (1102103332513) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7136748 + ... + 7289538.
It is an arithmetic number, because the mean of its divisors is an integer number (71226282680).
Almost surely, 21102103332113 is an apocalyptic number.
It is an amenable number.
1102103332113 is a deficient number, since it is larger than the sum of its proper divisors (607327452207).
1102103332113 is a wasteful number, since it uses less digits than its factorization.
1102103332113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201877 (or 201870 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1102103332113 its reverse (3112333012011), we get a palindrome (4214436344124).
The spelling of 1102103332113 in words is "one trillion, one hundred two billion, one hundred three million, three hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •