Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …111101111100010010001 |
3 | 21002101210120020220012201 |
4 | 131020213013233202101 |
5 | 230300310420213243 |
6 | 4131431313123201 |
7 | 264435115365466 |
oct | 35104707574221 |
9 | 7071716226181 |
10 | 2002111101073 |
11 | 7020aa581316 |
12 | 284032b59501 |
13 | 116a4ba3acc5 |
14 | 6cc8cdc966d |
15 | 3712d4d904d |
hex | 1d2271ef891 |
2002111101073 has 2 divisors, whose sum is σ = 2002111101074. Its totient is φ = 2002111101072.
The previous prime is 2002111100939. The next prime is 2002111101127. The reversal of 2002111101073 is 3701011112002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1835003472129 + 167107628944 = 1354623^2 + 408788^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002111101073 - 213 = 2002111092881 is a prime.
It is a super-2 number, since 2×20021111010732 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2002111101073.
It is not a weakly prime, because it can be changed into another prime (2002111101373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001055550536 + 1001055550537.
It is an arithmetic number, because the mean of its divisors is an integer number (1001055550537).
Almost surely, 22002111101073 is an apocalyptic number.
It is an amenable number.
2002111101073 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002111101073 is an equidigital number, since it uses as much as digits as its factorization.
2002111101073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 2002111101073 its reverse (3701011112002), we get a palindrome (5703122213075).
The spelling of 2002111101073 in words is "two trillion, two billion, one hundred eleven million, one hundred one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •