Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001010011100110100111101 |
3 | 111010102122202111200121111201 |
4 | 112300223100022130310331 |
5 | 101110032344022413041 |
6 | 552522120221015501 |
7 | 30041062611430510 |
oct | 2660532012346475 |
9 | 433378674617451 |
10 | 100102000201021 |
11 | 29994024506975 |
12 | b2885313b4591 |
13 | 43b1769170390 |
14 | 1aa0d69780d77 |
15 | b88d3940b631 |
hex | 5b0ad029cd3d |
100102000201021 has 64 divisors (see below), whose sum is σ = 126214075187200. Its totient is φ = 77269884007680.
The previous prime is 100102000200997. The next prime is 100102000201043. The reversal of 100102000201021 is 120102000201001.
It is not a de Polignac number, because 100102000201021 - 213 = 100102000192829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100102000200989 and 100102000201007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102000201121) 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 63 ways as a sum of consecutive naturals, for example, 22005273655 + ... + 22005278203.
It is an arithmetic number, because the mean of its divisors is an integer number (1972094924800).
Almost surely, 2100102000201021 is an apocalyptic number.
It is an amenable number.
100102000201021 is a deficient number, since it is larger than the sum of its proper divisors (26112074986179).
100102000201021 is a wasteful number, since it uses less digits than its factorization.
100102000201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9906.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100102000201021 its reverse (120102000201001), we get a palindrome (220204000402022).
The spelling of 100102000201021 in words is "one hundred trillion, one hundred two billion, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •