Base | Representation |
---|---|
bin | 101111000101001010… |
… | …1000000010101100100 |
3 | 100122222011220200000202 |
4 | 1132022111000111210 |
5 | 3124030340310040 |
6 | 114240315130032 |
7 | 10206322256030 |
oct | 1361225002544 |
9 | 318864820022 |
10 | 101105010020 |
11 | 39973162523 |
12 | 17717a43918 |
13 | 96c3725921 |
14 | 4c71b051c0 |
15 | 296b260015 |
hex | 178a540564 |
101105010020 has 48 divisors (see below), whose sum is σ = 242714828160. Its totient is φ = 34655602944.
The previous prime is 101105010011. The next prime is 101105010049. The reversal of 101105010020 is 20010501101.
It is a super-2 number, since 2×1011050100202 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101105009983 and 101105010010.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 461096 + ... + 644064.
It is an arithmetic number, because the mean of its divisors is an integer number (5056558920).
Almost surely, 2101105010020 is an apocalyptic number.
101105010020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101105010020 is an abundant number, since it is smaller than the sum of its proper divisors (141609818140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101105010020 is a wasteful number, since it uses less digits than its factorization.
101105010020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186932 (or 186930 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 11.
Adding to 101105010020 its reverse (20010501101), we get a palindrome (121115511121).
The spelling of 101105010020 in words is "one hundred one billion, one hundred five million, ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •