Base | Representation |
---|---|
bin | 10110111101101111110001… |
… | …000011100100111000110101 |
3 | 111020121112011121110210000210 |
4 | 112331233301003210320311 |
5 | 101214241402223241041 |
6 | 554450503524300033 |
7 | 30163011054520635 |
oct | 2675576103447065 |
9 | 436545147423023 |
10 | 101000200212021 |
11 | 2a1aaa42a4a350 |
12 | b3b2622841619 |
13 | 444837ca41426 |
14 | 1ad2615a946c5 |
15 | ba23a88d3016 |
hex | 5bdbf10e4e35 |
101000200212021 has 64 divisors (see below), whose sum is σ = 158018037350400. Its totient is φ = 56725676222400.
The previous prime is 101000200212019. The next prime is 101000200212029. The reversal of 101000200212021 is 120212002000101.
It is not a de Polignac number, because 101000200212021 - 21 = 101000200212019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101000200211988 and 101000200212006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000200212029) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 53021820 + ... + 54893658.
It is an arithmetic number, because the mean of its divisors is an integer number (2469031833600).
Almost surely, 2101000200212021 is an apocalyptic number.
101000200212021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101000200212021 is a deficient number, since it is larger than the sum of its proper divisors (57017837138379).
101000200212021 is a wasteful number, since it uses less digits than its factorization.
101000200212021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1873750.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101000200212021 its reverse (120212002000101), we get a palindrome (221212202212122).
The spelling of 101000200212021 in words is "one hundred one trillion, two hundred million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •