Base | Representation |
---|---|
bin | 100110010111… |
… | …0011011001100 |
3 | 1101211211222122 |
4 | 1030232123030 |
5 | 20122104400 |
6 | 1555032112 |
7 | 332646530 |
oct | 114563314 |
9 | 41754878 |
10 | 20113100 |
11 | 103982a7 |
12 | 689b638 |
13 | 4222a57 |
14 | 2957bc0 |
15 | 1b74685 |
hex | 132e6cc |
20113100 has 72 divisors (see below), whose sum is σ = 50830080. Its totient is φ = 6765120.
The previous prime is 20113099. The next prime is 20113123. The reversal of 20113100 is 131102.
It is a super-2 number, since 2×201131002 = 809073583220000, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 41057 + ... + 41543.
Almost surely, 220113100 is an apocalyptic number.
20113100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20113100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25415040).
20113100 is an abundant number, since it is smaller than the sum of its proper divisors (30716980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20113100 is a wasteful number, since it uses less digits than its factorization.
20113100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 567 (or 560 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 8.
The square root of 20113100 is about 4484.7630929627. The cubic root of 20113100 is about 271.9524679053.
Adding to 20113100 its reverse (131102), we get a palindrome (20244202).
The spelling of 20113100 in words is "twenty million, one hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •