Base | Representation |
---|---|
bin | 101111110001101010100001… |
… | …100010011001010000001101 |
3 | 1000112222101021202021000201021 |
4 | 233301222201202121100031 |
5 | 210020111003122444041 |
6 | 2022520144552114141 |
7 | 62154514512504400 |
oct | 5761524142312015 |
9 | 1015871252230637 |
10 | 210121100203021 |
11 | 60a50949245287 |
12 | 1b696a63395951 |
13 | 9032447523967 |
14 | 39c5cb624bd37 |
15 | 1945aea85dcd1 |
hex | bf1aa189940d |
210121100203021 has 12 divisors (see below), whose sum is σ = 255053828819232. Its totient is φ = 172273200165528.
The previous prime is 210121100202953. The next prime is 210121100203033. The reversal of 210121100203021 is 120302001121012.
It is not a de Polignac number, because 210121100203021 - 213 = 210121100194829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210121100202986 and 210121100203004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210121100203061) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 93221427535 + ... + 93221429788.
It is an arithmetic number, because the mean of its divisors is an integer number (21254485734936).
Almost surely, 2210121100203021 is an apocalyptic number.
It is an amenable number.
210121100203021 is a deficient number, since it is larger than the sum of its proper divisors (44932728616211).
210121100203021 is a wasteful number, since it uses less digits than its factorization.
210121100203021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186442857360 (or 186442857353 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 210121100203021 its reverse (120302001121012), we get a palindrome (330423101324033).
The spelling of 210121100203021 in words is "two hundred ten trillion, one hundred twenty-one billion, one hundred million, two hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •