Base | Representation |
---|---|
bin | 11101001000100111001… |
… | …111010111110100101101 |
3 | 21002101210201000111201211 |
4 | 131020213033113310231 |
5 | 230300311423213401 |
6 | 4131431424034421 |
7 | 264435141365461 |
oct | 35104717276455 |
9 | 7071721014654 |
10 | 2002113101101 |
11 | 702100717a33 |
12 | 284033762a11 |
13 | 116a4c28b459 |
14 | 6cc8d38a4a1 |
15 | 3712d781951 |
hex | 1d2273d7d2d |
2002113101101 has 4 divisors (see below), whose sum is σ = 2002190330332. Its totient is φ = 2002035871872.
The previous prime is 2002113101039. The next prime is 2002113101111. The reversal of 2002113101101 is 1011013112002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 451463048100 + 1550650053001 = 671910^2 + 1245251^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002113101101 - 217 = 2002112970029 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 (2002113101111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38575716 + ... + 38627581.
It is an arithmetic number, because the mean of its divisors is an integer number (500547582583).
Almost surely, 22002113101101 is an apocalyptic number.
It is an amenable number.
2002113101101 is a deficient number, since it is larger than the sum of its proper divisors (77229231).
2002113101101 is an equidigital number, since it uses as much as digits as its factorization.
2002113101101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77229230.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 2002113101101 its reverse (1011013112002), we get a palindrome (3013126213103).
The spelling of 2002113101101 in words is "two trillion, two billion, one hundred thirteen million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •