Base | Representation |
---|---|
bin | 100110010111… |
… | …0011110010100 |
3 | 1101211212021001 |
4 | 1030232132110 |
5 | 20122111200 |
6 | 1555033044 |
7 | 332650234 |
oct | 114563624 |
9 | 41755231 |
10 | 20113300 |
11 | 10398469 |
12 | 689b784 |
13 | 4222b7c |
14 | 2957cc4 |
15 | 1b7476a |
hex | 132e794 |
20113300 has 36 divisors (see below), whose sum is σ = 43990240. Its totient is φ = 7981920.
The previous prime is 20113273. The next prime is 20113319. The reversal of 20113300 is 331102.
It is a Harshad number since it is a multiple of its sum of digits (10).
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 11 ways as a sum of consecutive naturals, for example, 13177 + ... + 14623.
Almost surely, 220113300 is an apocalyptic number.
20113300 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 20113300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21995120).
20113300 is an abundant number, since it is smaller than the sum of its proper divisors (23876940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20113300 is a wasteful number, since it uses less digits than its factorization.
20113300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1600 (or 1593 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 10.
The square root of 20113300 is about 4484.7853906291. The cubic root of 20113300 is about 271.9533693131.
Adding to 20113300 its reverse (331102), we get a palindrome (20444402).
The spelling of 20113300 in words is "twenty million, one hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •