Base | Representation |
---|---|
bin | 10110111101110000101101… |
… | …010011100000001011110101 |
3 | 111020121121210001111010221010 |
4 | 112331300231103200023311 |
5 | 101214300440010120041 |
6 | 554451152113342433 |
7 | 30163045110325014 |
oct | 2675605523401365 |
9 | 436547701433833 |
10 | 101001211020021 |
11 | 2a200411585364 |
12 | b3b2865267a19 |
13 | 44484b1293b80 |
14 | 1ad26b0016a7b |
15 | ba24174eba16 |
hex | 5bdc2d4e02f5 |
101001211020021 has 64 divisors (see below), whose sum is σ = 150132947779584. Its totient is φ = 59978084774400.
The previous prime is 101001211020019. The next prime is 101001211020041. The reversal of 101001211020021 is 120020112100101.
It is not a de Polignac number, because 101001211020021 - 21 = 101001211020019 is a prime.
It is a super-2 number, since 2×1010012110200212 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101001211019979 and 101001211020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001211020041) 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, 996773466 + ... + 996874788.
It is an arithmetic number, because the mean of its divisors is an integer number (2345827309056).
Almost surely, 2101001211020021 is an apocalyptic number.
It is an amenable number.
101001211020021 is a deficient number, since it is larger than the sum of its proper divisors (49131736759563).
101001211020021 is a wasteful number, since it uses less digits than its factorization.
101001211020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103714.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101001211020021 its reverse (120020112100101), we get a palindrome (221021323120122).
The spelling of 101001211020021 in words is "one hundred one trillion, one billion, two hundred eleven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •