Base | Representation |
---|---|
bin | 101111000010111011… |
… | …0110111111000011001 |
3 | 100122202221202212122101 |
4 | 1132011312313320121 |
5 | 3123402140032301 |
6 | 114225035323401 |
7 | 10204421564242 |
oct | 1360566677031 |
9 | 318687685571 |
10 | 101030002201 |
11 | 39934890a97 |
12 | 176b68b0561 |
13 | 96b10228bb |
14 | 4c65b7bcc9 |
15 | 2964895701 |
hex | 1785db7e19 |
101030002201 has 2 divisors, whose sum is σ = 101030002202. Its totient is φ = 101030002200.
The previous prime is 101030002159. The next prime is 101030002211. The reversal of 101030002201 is 102200030101.
It is an a-pointer prime, because the next prime (101030002211) can be obtained adding 101030002201 to its sum of digits (10).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61095974976 + 39934027225 = 247176^2 + 199835^2 .
It is a cyclic number.
It is not a de Polignac number, because 101030002201 - 215 = 101029969433 is a prime.
It is a super-2 number, since 2×1010300022012 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101030002211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50515001100 + 50515001101.
It is an arithmetic number, because the mean of its divisors is an integer number (50515001101).
Almost surely, 2101030002201 is an apocalyptic number.
It is an amenable number.
101030002201 is a deficient number, since it is larger than the sum of its proper divisors (1).
101030002201 is an equidigital number, since it uses as much as digits as its factorization.
101030002201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 101030002201 its reverse (102200030101), we get a palindrome (203230032302).
The spelling of 101030002201 in words is "one hundred one billion, thirty million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •