Base | Representation |
---|---|
bin | 11001101110010010011001… |
… | …110111110011110110111110 |
3 | 112211120022111222222002021010 |
4 | 121232102121313303312332 |
5 | 104312023334122333042 |
6 | 1040340044344420050 |
7 | 32554342631344650 |
oct | 3156223167636676 |
9 | 484508458862233 |
10 | 113132020121022 |
11 | 33058025015901 |
12 | 108318b0777626 |
13 | 4b183c4376766 |
14 | 1dd18947186d0 |
15 | d12c5430459c |
hex | 66e499df3dbe |
113132020121022 has 64 divisors (see below), whose sum is σ = 264098942415360. Its totient is φ = 31639203462144.
The previous prime is 113132020120967. The next prime is 113132020121027. The reversal of 113132020121022 is 220121020231311.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 113132020121022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113132020121027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 97393803 + ... + 98548550.
It is an arithmetic number, because the mean of its divisors is an integer number (4126545975240).
Almost surely, 2113132020121022 is an apocalyptic number.
113132020121022 is an abundant number, since it is smaller than the sum of its proper divisors (150966922294338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113132020121022 is a wasteful number, since it uses less digits than its factorization.
113132020121022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 195942657.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 113132020121022 its reverse (220121020231311), we get a palindrome (333253040352333).
The spelling of 113132020121022 in words is "one hundred thirteen trillion, one hundred thirty-two billion, twenty million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •