Base | Representation |
---|---|
bin | 10000000010010100011… |
… | …001000000011010000101 |
3 | 10220100110100200211011011 |
4 | 100002110121000122011 |
5 | 121023344302223023 |
6 | 2202130302242221 |
7 | 142421421511663 |
oct | 20022431003205 |
9 | 3810410624134 |
10 | 1102001211013 |
11 | 3953a0a5549a |
12 | 1596a9b86371 |
13 | 7cbc25878c1 |
14 | 3b4a1199c33 |
15 | 1d9eb50250d |
hex | 10094640685 |
1102001211013 has 8 divisors (see below), whose sum is σ = 1154189088000. Its totient is φ = 1050169565808.
The previous prime is 1102001210971. The next prime is 1102001211029. The reversal of 1102001211013 is 3101121002011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102001211013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102001210984 and 1102001211002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102001218013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89051613 + ... + 89063986.
It is an arithmetic number, because the mean of its divisors is an integer number (144273636000).
Almost surely, 21102001211013 is an apocalyptic number.
It is an amenable number.
1102001211013 is a deficient number, since it is larger than the sum of its proper divisors (52187876987).
1102001211013 is a wasteful number, since it uses less digits than its factorization.
1102001211013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178115891.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1102001211013 its reverse (3101121002011), we get a palindrome (4203122213024).
The spelling of 1102001211013 in words is "one trillion, one hundred two billion, one million, two hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •