Base | Representation |
---|---|
bin | 10110111101111000111001… |
… | …010010110110111000010101 |
3 | 111020122110110201110220001010 |
4 | 112331320321102312320111 |
5 | 101214421441020041041 |
6 | 554455204313122433 |
7 | 30163506005350602 |
oct | 2675707122667025 |
9 | 436573421426033 |
10 | 101010002112021 |
11 | 2a204112959952 |
12 | b3b44b93b9419 |
13 | 444928268b362 |
14 | 1ad2ca57ab6a9 |
15 | ba277e1aea16 |
hex | 5bde394b6e15 |
101010002112021 has 8 divisors (see below), whose sum is σ = 134680263025984. Its totient is φ = 67339871303040.
The previous prime is 101010002111981. The next prime is 101010002112073. The reversal of 101010002112021 is 120211200010101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101010002112021 - 214 = 101010002095637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101010002111988 and 101010002112006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101010002112821) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30700060 + ... + 33830661.
It is an arithmetic number, because the mean of its divisors is an integer number (16835032878248).
Almost surely, 2101010002112021 is an apocalyptic number.
It is an amenable number.
101010002112021 is a deficient number, since it is larger than the sum of its proper divisors (33670260913963).
101010002112021 is an equidigital number, since it uses as much as digits as its factorization.
101010002112021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65052491.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101010002112021 its reverse (120211200010101), we get a palindrome (221221202122122).
The spelling of 101010002112021 in words is "one hundred one trillion, ten billion, two million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •