Base | Representation |
---|---|
bin | 110100101101111010… |
… | …1111101010010011110 |
3 | 101211012210121221101120 |
4 | 1221123311331102132 |
5 | 3323323231133042 |
6 | 124001415351410 |
7 | 11115310205220 |
oct | 1513365752236 |
9 | 354183557346 |
10 | 113210021022 |
11 | 4401511844a |
12 | 19b35982566 |
13 | a8a2566a27 |
14 | 569d65a410 |
15 | 2e28d24dec |
hex | 1a5bd7d49e |
113210021022 has 128 divisors (see below), whose sum is σ = 270065664000. Its totient is φ = 30958329600.
The previous prime is 113210021011. The next prime is 113210021129. The reversal of 113210021022 is 220120012311.
It is a junction number, because it is equal to n+sod(n) for n = 113210020992 and 113210021010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 46377322 + ... + 46379762.
It is an arithmetic number, because the mean of its divisors is an integer number (2109888000).
Almost surely, 2113210021022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113210021022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135032832000).
113210021022 is an abundant number, since it is smaller than the sum of its proper divisors (156855642978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113210021022 is a wasteful number, since it uses less digits than its factorization.
113210021022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2862.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 113210021022 its reverse (220120012311), we get a palindrome (333330033333).
The spelling of 113210021022 in words is "one hundred thirteen billion, two hundred ten million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •