Base | Representation |
---|---|
bin | 10110111101110001101000… |
… | …010100011100000011111101 |
3 | 111020121201100001112111011112 |
4 | 112331301220110130003331 |
5 | 101214310001441333041 |
6 | 554451434242531405 |
7 | 30163111462126604 |
oct | 2675615024340375 |
9 | 436551301474145 |
10 | 101002201121021 |
11 | 2a20087a457952 |
12 | b3b2aa0966b65 |
13 | 444860b446455 |
14 | 1ad2765708a3b |
15 | ba24743c4deb |
hex | 5bdc6851c0fd |
101002201121021 has 16 divisors (see below), whose sum is σ = 107293365480000. Its totient is φ = 94811267563776.
The previous prime is 101002201121011. The next prime is 101002201121027. The reversal of 101002201121021 is 120121102200101.
It is a cyclic number.
It is not a de Polignac number, because 101002201121021 - 230 = 101001127379197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101002201120987 and 101002201121005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101002201121027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36223436 + ... + 38911973.
It is an arithmetic number, because the mean of its divisors is an integer number (6705835342500).
Almost surely, 2101002201121021 is an apocalyptic number.
It is an amenable number.
101002201121021 is a deficient number, since it is larger than the sum of its proper divisors (6291164358979).
101002201121021 is a wasteful number, since it uses less digits than its factorization.
101002201121021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75136076.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101002201121021 its reverse (120121102200101), we get a palindrome (221123303321122).
The spelling of 101002201121021 in words is "one hundred one trillion, two billion, two hundred one million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •