Base | Representation |
---|---|
bin | 10111001100011100001111… |
… | …000000011011111100100001 |
3 | 111101012001200200121010122200 |
4 | 113030130033000123330201 |
5 | 101332313010111120001 |
6 | 1000542431203323413 |
7 | 30325660251333522 |
oct | 2714341700337441 |
9 | 441161620533580 |
10 | 102010020020001 |
11 | 2a55a22a9a6325 |
12 | b536285380569 |
13 | 44bc671587022 |
14 | 1b29450356849 |
15 | bbd7ac2b2086 |
hex | 5cc70f01bf21 |
102010020020001 has 24 divisors (see below), whose sum is σ = 147471076896000. Its totient is φ = 67949794173312.
The previous prime is 102010020019991. The next prime is 102010020020017. The reversal of 102010020020001 is 100020020010201.
It is not a de Polignac number, because 102010020020001 - 25 = 102010020019969 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 (102010020020401) 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, 154099560 + ... + 154760118.
It is an arithmetic number, because the mean of its divisors is an integer number (6144628204000).
Almost surely, 2102010020020001 is an apocalyptic number.
It is an amenable number.
102010020020001 is a deficient number, since it is larger than the sum of its proper divisors (45461056875999).
102010020020001 is a wasteful number, since it uses less digits than its factorization.
102010020020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674893 (or 674890 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 102010020020001 its reverse (100020020010201), we get a palindrome (202030040030202).
The spelling of 102010020020001 in words is "one hundred two trillion, ten billion, twenty million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •