Base | Representation |
---|---|
bin | 10111001100010100111100… |
… | …111101010000000011011001 |
3 | 111101011022111202201212122211 |
4 | 113030110330331100003121 |
5 | 101332201001424032301 |
6 | 1000535055250515121 |
7 | 30325262425642333 |
oct | 2714247475200331 |
9 | 441138452655584 |
10 | 102002201002201 |
11 | 2a556988301545 |
12 | b534862895aa1 |
13 | 44bb9c669cb86 |
14 | 1b28d0bb20453 |
15 | bbd4a0b16051 |
hex | 5cc53cf500d9 |
102002201002201 has 2 divisors, whose sum is σ = 102002201002202. Its totient is φ = 102002201002200.
The previous prime is 102002201002153. The next prime is 102002201002213. The reversal of 102002201002201 is 102200102200201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73351071346576 + 28651129655625 = 8564524^2 + 5352675^2 .
It is a cyclic number.
It is not a de Polignac number, because 102002201002201 - 211 = 102002201000153 is a prime.
It is not a weakly prime, because it can be changed into another prime (102002231002201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51001100501100 + 51001100501101.
It is an arithmetic number, because the mean of its divisors is an integer number (51001100501101).
Almost surely, 2102002201002201 is an apocalyptic number.
It is an amenable number.
102002201002201 is a deficient number, since it is larger than the sum of its proper divisors (1).
102002201002201 is an equidigital number, since it uses as much as digits as its factorization.
102002201002201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 102002201002201 its reverse (102200102200201), we get a palindrome (204202303202402).
The spelling of 102002201002201 in words is "one hundred two trillion, two billion, two hundred one million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •