Base | Representation |
---|---|
bin | 10111001100010100111101… |
… | …100011011001011100000111 |
3 | 111101011022112110112220222011 |
4 | 113030110331203121130013 |
5 | 101332201012004031434 |
6 | 1000535100245115051 |
7 | 30325262606641531 |
oct | 2714247543313407 |
9 | 441138473486864 |
10 | 102002211002119 |
11 | 2a556992a1163a |
12 | b5348660b8a87 |
13 | 44bb9c879169c |
14 | 1b28d0d1a4851 |
15 | bbd4a193de64 |
hex | 5cc53d8d9707 |
102002211002119 has 2 divisors, whose sum is σ = 102002211002120. Its totient is φ = 102002211002118.
The previous prime is 102002211002101. The next prime is 102002211002141. The reversal of 102002211002119 is 911200112200201.
It is an a-pointer prime, because the next prime (102002211002141) can be obtained adding 102002211002119 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102002211002119 - 243 = 93206117979911 is a prime.
It is a super-2 number, since 2×1020022110021192 (a number of 29 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 102002211002119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102002211000119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51001105501059 + 51001105501060.
It is an arithmetic number, because the mean of its divisors is an integer number (51001105501060).
Almost surely, 2102002211002119 is an apocalyptic number.
102002211002119 is a deficient number, since it is larger than the sum of its proper divisors (1).
102002211002119 is an equidigital number, since it uses as much as digits as its factorization.
102002211002119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 102002211002119 in words is "one hundred two trillion, two billion, two hundred eleven million, two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •