Base | Representation |
---|---|
bin | 10110101111100000000000… |
… | …001110100111010001011001 |
3 | 111010010221012120000220111121 |
4 | 112233200000032213101121 |
5 | 101102221410232020441 |
6 | 552421034515525241 |
7 | 30032202430062130 |
oct | 2657400016472131 |
9 | 433127176026447 |
10 | 100021202220121 |
11 | 29962832118a46 |
12 | b2749422b9821 |
13 | 43a6c60911720 |
14 | 1a9b0a2a44917 |
15 | b86baad63dd1 |
hex | 5af8003a7459 |
100021202220121 has 24 divisors (see below), whose sum is σ = 129923129966784. Its totient is φ = 74972514768480.
The previous prime is 100021202220119. The next prime is 100021202220131. The reversal of 100021202220121 is 121022202120001.
It is a happy number.
It is not a de Polignac number, because 100021202220121 - 21 = 100021202220119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100021202220095 and 100021202220104.
It is not an unprimeable number, because it can be changed into a prime (100021202220131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1522313535 + ... + 1522379236.
It is an arithmetic number, because the mean of its divisors is an integer number (5413463748616).
Almost surely, 2100021202220121 is an apocalyptic number.
It is an amenable number.
100021202220121 is a deficient number, since it is larger than the sum of its proper divisors (29901927746663).
100021202220121 is a wasteful number, since it uses less digits than its factorization.
100021202220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3044692829 (or 3044692810 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 100021202220121 its reverse (121022202120001), we get a palindrome (221043404340122).
The spelling of 100021202220121 in words is "one hundred trillion, twenty-one billion, two hundred two million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •