Base | Representation |
---|---|
bin | 101111011111111001… |
… | …0110100111100000101 |
3 | 100202021200210111112100 |
4 | 1132333302310330011 |
5 | 3132400004120401 |
6 | 114505321142313 |
7 | 10240463602542 |
oct | 1367762647405 |
9 | 322250714470 |
10 | 102002020101 |
11 | 3a293532473 |
12 | 1792832a999 |
13 | 9807513417 |
14 | 4d18cc3bc9 |
15 | 29bed9ab86 |
hex | 17bfcb4f05 |
102002020101 has 12 divisors (see below), whose sum is σ = 150116181228. Its totient is φ = 66718302144.
The previous prime is 102002020079. The next prime is 102002020139. The reversal of 102002020101 is 101020200201.
It can be written as a sum of positive squares in 2 ways, for example, as 66383007201 + 35619012900 = 257649^2 + 188730^2 .
It is not a de Polignac number, because 102002020101 - 230 = 100928278277 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102002020181) 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 in 11 ways as a sum of consecutive naturals, for example, 106919880 + ... + 106920833.
It is an arithmetic number, because the mean of its divisors is an integer number (12509681769).
Almost surely, 2102002020101 is an apocalyptic number.
It is an amenable number.
102002020101 is a deficient number, since it is larger than the sum of its proper divisors (48114161127).
102002020101 is a wasteful number, since it uses less digits than its factorization.
102002020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213840772 (or 213840769 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 102002020101 its reverse (101020200201), we get a palindrome (203022220302).
The spelling of 102002020101 in words is "one hundred two billion, two million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •