Base | Representation |
---|---|
bin | 110100101101101000… |
… | …0001101011001010010 |
3 | 101211012010000012022120 |
4 | 1221123100031121102 |
5 | 3323313213004042 |
6 | 124000423315110 |
7 | 11115130122321 |
oct | 1513320153122 |
9 | 354163005276 |
10 | 113200125522 |
11 | 4400a579850 |
12 | 19b325aba96 |
13 | a8a04b08c3 |
14 | 569c2020b8 |
15 | 2e2801cdec |
hex | 1a5b40d652 |
113200125522 has 64 divisors (see below), whose sum is σ = 252433843200. Its totient is φ = 33554072000.
The previous prime is 113200125469. The next prime is 113200125553. The reversal of 113200125522 is 225521002311.
It is a junction number, because it is equal to n+sod(n) for n = 113200125492 and 113200125501.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 450979 + ... + 655577.
It is an arithmetic number, because the mean of its divisors is an integer number (3944278800).
Almost surely, 2113200125522 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113200125522, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126216921600).
113200125522 is an abundant number, since it is smaller than the sum of its proper divisors (139233717678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113200125522 is a wasteful number, since it uses less digits than its factorization.
113200125522 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204799.
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 113200125522 its reverse (225521002311), we get a palindrome (338721127833).
The spelling of 113200125522 in words is "one hundred thirteen billion, two hundred million, one hundred twenty-five thousand, five hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •