Base | Representation |
---|---|
bin | 10111001100010010111011… |
… | …000101000011100010010001 |
3 | 111101011002212220120121022000 |
4 | 113030102323011003202101 |
5 | 101332132021113310001 |
6 | 1000534055131304213 |
7 | 30325154426550363 |
oct | 2714227305034221 |
9 | 441132786517260 |
10 | 102000022010001 |
11 | 2a555a6a320445 |
12 | b534354bab069 |
13 | 44bb73a11558b |
14 | 1b28b82590d33 |
15 | bbd3c4698a86 |
hex | 5cc4bb143891 |
102000022010001 has 32 divisors (see below), whose sum is σ = 151361568462720. Its totient is φ = 67887329297472.
The previous prime is 102000022009981. The next prime is 102000022010011. The reversal of 102000022010001 is 100010220000201.
It is not a de Polignac number, because 102000022010001 - 213 = 102000022001809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (102000022010011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1092931726 + ... + 1093025048.
It is an arithmetic number, because the mean of its divisors is an integer number (4730049014460).
Almost surely, 2102000022010001 is an apocalyptic number.
It is an amenable number.
102000022010001 is a deficient number, since it is larger than the sum of its proper divisors (49361546452719).
102000022010001 is an equidigital number, since it uses as much as digits as its factorization.
102000022010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159982 (or 159976 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 102000022010001 its reverse (100010220000201), we get a palindrome (202010242010202).
The spelling of 102000022010001 in words is "one hundred two trillion, twenty-two million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •