Base | Representation |
---|---|
bin | 110100101010101101… |
… | …0101110101011110100 |
3 | 101210221021210002012212 |
4 | 1221111122232223310 |
5 | 3323113132020040 |
6 | 123543005032552 |
7 | 11112531002456 |
oct | 1512532565364 |
9 | 353837702185 |
10 | 113102220020 |
11 | 43a6a288a09 |
12 | 19b05855758 |
13 | a88612155a |
14 | 568d1d82d6 |
15 | 2e1e62dd65 |
hex | 1a556aeaf4 |
113102220020 has 48 divisors (see below), whose sum is σ = 242805427200. Its totient is φ = 44241156480.
The previous prime is 113102219983. The next prime is 113102220043. The reversal of 113102220020 is 20022201311.
It is a happy number.
It is a super-2 number, since 2×1131022200202 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113102219977 and 113102220004.
It is a congruent number.
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, 25535 + ... + 476294.
It is an arithmetic number, because the mean of its divisors is an integer number (5058446400).
Almost surely, 2113102220020 is an apocalyptic number.
113102220020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113102220020 is an abundant number, since it is smaller than the sum of its proper divisors (129703207180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113102220020 is a wasteful number, since it uses less digits than its factorization.
113102220020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502088 (or 502086 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 113102220020 its reverse (20022201311), we get a palindrome (133124421331).
The spelling of 113102220020 in words is "one hundred thirteen billion, one hundred two million, two hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •