Base | Representation |
---|---|
bin | 110100101010101100… |
… | …1111011101010001110 |
3 | 101210221021101110112012 |
4 | 1221111121323222032 |
5 | 3323113103323042 |
6 | 123543000341222 |
7 | 11112526142240 |
oct | 1512531735216 |
9 | 353837343465 |
10 | 113102011022 |
11 | 43a6a155990 |
12 | 19b05774812 |
13 | a88607a3a0 |
14 | 568d182090 |
15 | 2e1e5dbe82 |
hex | 1a5567ba8e |
113102011022 has 64 divisors (see below), whose sum is σ = 228673234944. Its totient is φ = 40517591040.
The previous prime is 113102011021. The next prime is 113102011027. The reversal of 113102011022 is 220110201311.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 113102010988 and 113102011006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113102011021) 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, 404603 + ... + 624425.
It is an arithmetic number, because the mean of its divisors is an integer number (3573019296).
Almost surely, 2113102011022 is an apocalyptic number.
113102011022 is an abundant number, since it is smaller than the sum of its proper divisors (115571223922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113102011022 is a wasteful number, since it uses less digits than its factorization.
113102011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220113.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 113102011022 its reverse (220110201311), we get a palindrome (333212212333).
The spelling of 113102011022 in words is "one hundred thirteen billion, one hundred two million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •