Base | Representation |
---|---|
bin | 10000000001101010110… |
… | …010010011100111010101 |
3 | 10220021122201021012100022 |
4 | 100001222302103213111 |
5 | 121020432104401323 |
6 | 2201533125354525 |
7 | 142365214514036 |
oct | 20015262234725 |
9 | 3807581235308 |
10 | 1101303200213 |
11 | 395072a44667 |
12 | 159534268a45 |
13 | 7cb10a93a68 |
14 | 3b4365bca8d |
15 | 1d9aa0c44c8 |
hex | 1006ac939d5 |
1101303200213 has 24 divisors (see below), whose sum is σ = 1239026015520. Its totient is φ = 975941809920.
The previous prime is 1101303200167. The next prime is 1101303200219. The reversal of 1101303200213 is 3120023031011.
It is not a de Polignac number, because 1101303200213 - 212 = 1101303196117 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101303200191 and 1101303200200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101303200219) 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, 279803 + ... + 1510263.
It is an arithmetic number, because the mean of its divisors is an integer number (51626083980).
Almost surely, 21101303200213 is an apocalyptic number.
It is an amenable number.
1101303200213 is a deficient number, since it is larger than the sum of its proper divisors (137722815307).
1101303200213 is a wasteful number, since it uses less digits than its factorization.
1101303200213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1230677 (or 1230660 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1101303200213 its reverse (3120023031011), we get a palindrome (4221326231224).
The spelling of 1101303200213 in words is "one trillion, one hundred one billion, three hundred three million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •