Base | Representation |
---|---|
bin | 10111001100100101100111… |
… | …111100001000110110000001 |
3 | 111101020000201022121210012100 |
4 | 113030211213330020312001 |
5 | 101332444132103000001 |
6 | 1000551215435221013 |
7 | 30326465142626313 |
oct | 2714454774106601 |
9 | 441200638553170 |
10 | 102020102000001 |
11 | 2a563533a140a9 |
12 | b5382198a7769 |
13 | 44c05ba248b73 |
14 | 1b29b293397b3 |
15 | bbdb9c465586 |
hex | 5cc967f08d81 |
102020102000001 has 24 divisors (see below), whose sum is σ = 147696389568000. Its totient is φ = 67859297703936.
The previous prime is 102020101999897. The next prime is 102020102000021. The reversal of 102020102000001 is 100000201020201.
It is not a de Polignac number, because 102020102000001 - 29 = 102020101999489 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 (102020102000021) 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 23 ways as a sum of consecutive naturals, for example, 18138625 + ... + 23087873.
It is an arithmetic number, because the mean of its divisors is an integer number (6154016232000).
Almost surely, 2102020102000001 is an apocalyptic number.
It is an amenable number.
102020102000001 is a deficient number, since it is larger than the sum of its proper divisors (45676287567999).
102020102000001 is a wasteful number, since it uses less digits than its factorization.
102020102000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4954445 (or 4954442 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 102020102000001 its reverse (100000201020201), we get a palindrome (202020303020202).
The spelling of 102020102000001 in words is "one hundred two trillion, twenty billion, one hundred two million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •