Base | Representation |
---|---|
bin | 101111000101000101… |
… | …0010111001011110101 |
3 | 100122221222122220212110 |
4 | 1132022022113023311 |
5 | 3124024132020041 |
6 | 114240135241233 |
7 | 10206256455645 |
oct | 1361212271365 |
9 | 318858586773 |
10 | 101102220021 |
11 | 39971627340 |
12 | 17716b19219 |
13 | 96c2c89a3a |
14 | 4c715ba525 |
15 | 296adad516 |
hex | 178a2972f5 |
101102220021 has 128 divisors (see below), whose sum is σ = 168605452800. Its totient is φ = 53137244160.
The previous prime is 101102220019. The next prime is 101102220041. The reversal of 101102220021 is 120022201101.
It is not a de Polignac number, because 101102220021 - 21 = 101102220019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101102219979 and 101102220006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101102220041) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 31901925 + ... + 31905093.
It is an arithmetic number, because the mean of its divisors is an integer number (1317230100).
Almost surely, 2101102220021 is an apocalyptic number.
101102220021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101102220021 is a deficient number, since it is larger than the sum of its proper divisors (67503232779).
101102220021 is a wasteful number, since it uses less digits than its factorization.
101102220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3319.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101102220021 its reverse (120022201101), we get a palindrome (221124421122).
It can be divided in two parts, 101102 and 220021, that added together give a palindrome (321123).
The spelling of 101102220021 in words is "one hundred one billion, one hundred two million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •