Base | Representation |
---|---|
bin | 11101000111101010110… |
… | …111000101111000101101 |
3 | 21002022012002212212212112 |
4 | 131013222313011320231 |
5 | 230241223111300323 |
6 | 4131143120013405 |
7 | 264401061141041 |
oct | 35075267057055 |
9 | 7068162785775 |
10 | 2001100103213 |
11 | 7017309266a2 |
12 | 2839b0461265 |
13 | 11691a450013 |
14 | 6cbd4a18021 |
15 | 370be884178 |
hex | 1d1eadc5e2d |
2001100103213 has 8 divisors (see below), whose sum is σ = 2066786256888. Its totient is φ = 1936448377344.
The previous prime is 2001100103203. The next prime is 2001100103257. The reversal of 2001100103213 is 3123010011002.
It can be written as a sum of positive squares in 4 ways, for example, as 241983318724 + 1759116784489 = 491918^2 + 1326317^2 .
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-2001100103213 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 (2001100103203) 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, 258603020 + ... + 258610757.
It is an arithmetic number, because the mean of its divisors is an integer number (258348282111).
Almost surely, 22001100103213 is an apocalyptic number.
It is an amenable number.
2001100103213 is a deficient number, since it is larger than the sum of its proper divisors (65686153675).
2001100103213 is an equidigital number, since it uses as much as digits as its factorization.
2001100103213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 517213903.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 2001100103213 its reverse (3123010011002), we get a palindrome (5124110114215).
The spelling of 2001100103213 in words is "two trillion, one billion, one hundred million, one hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •