Base | Representation |
---|---|
bin | 10110111111001101110110… |
… | …011000000100000010010100 |
3 | 111020222011220221021200111211 |
4 | 112333031312120010002110 |
5 | 101222420300111400040 |
6 | 555005132042511204 |
7 | 30203215336662556 |
oct | 2677156630040224 |
9 | 436864827250454 |
10 | 101101221200020 |
11 | 2a239872733888 |
12 | b40a116505504 |
13 | 4454a5bc29082 |
14 | 1ad747a5674d6 |
15 | ba4d1c5978ea |
hex | 5bf376604094 |
101101221200020 has 24 divisors (see below), whose sum is σ = 212347421542368. Its totient is φ = 40433849047200.
The previous prime is 101101221199981. The next prime is 101101221200047. The reversal of 101101221200020 is 20002122101101.
It is a super-3 number, since 3×1011012212000203 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 414839686 + ... + 415083325.
It is an arithmetic number, because the mean of its divisors is an integer number (8847809230932).
Almost surely, 2101101221200020 is an apocalyptic number.
101101221200020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101101221200020 is an abundant number, since it is smaller than the sum of its proper divisors (111246200342348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101221200020 is a wasteful number, since it uses less digits than its factorization.
101101221200020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 829929111 (or 829929109 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101101221200020 its reverse (20002122101101), we get a palindrome (121103343301121).
The spelling of 101101221200020 in words is "one hundred one trillion, one hundred one billion, two hundred twenty-one million, two hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •