Base | Representation |
---|---|
bin | 111011101010101… |
… | …1100101001111101 |
3 | 12011112022210010000 |
4 | 1313111130221331 |
5 | 13100020023401 |
6 | 530400104513 |
7 | 100420443414 |
oct | 16725345175 |
9 | 5145283100 |
10 | 2002111101 |
11 | 938159781 |
12 | 47a605139 |
13 | 25ba36233 |
14 | 14dc8847b |
15 | bab7d186 |
hex | 7755ca7d |
2002111101 has 10 divisors (see below), whose sum is σ = 2990808062. Its totient is φ = 1334740680.
The previous prime is 2002111081. The next prime is 2002111117. The reversal of 2002111101 is 1011112002.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1955939076 + 46172025 = 44226^2 + 6795^2 .
It is not a de Polignac number, because 2002111101 - 215 = 2002078333 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002111151) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 12358630 + ... + 12358791.
Almost surely, 22002111101 is an apocalyptic number.
It is an amenable number.
2002111101 is a deficient number, since it is larger than the sum of its proper divisors (988696961).
2002111101 is an equidigital number, since it uses as much as digits as its factorization.
2002111101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24717433 (or 24717424 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 2002111101 is about 44744.9561515038. The cubic root of 2002111101 is about 1260.3641974413.
Adding to 2002111101 its reverse (1011112002), we get a palindrome (3013223103).
Subtracting from 2002111101 its reverse (1011112002), we obtain a palindrome (990999099).
The spelling of 2002111101 in words is "two billion, two million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •