Base | Representation |
---|---|
bin | 110100001010110011… |
… | …0010101111000101110 |
3 | 101201011200002000010121 |
4 | 1220111212111320232 |
5 | 3313420032203400 |
6 | 123244440155154 |
7 | 11044150141066 |
oct | 1502546257056 |
9 | 351150060117 |
10 | 112031522350 |
11 | 4356a967a00 |
12 | 19867168aba |
13 | a745360137 |
14 | 55cad263a6 |
15 | 2daa63521a |
hex | 1a15995e2e |
112031522350 has 144 divisors (see below), whose sum is σ = 245262427200. Its totient is φ = 37908428800.
The previous prime is 112031522329. The next prime is 112031522353. The reversal of 112031522350 is 53225130211.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112031522353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 9147531 + ... + 9159769.
It is an arithmetic number, because the mean of its divisors is an integer number (1703211300).
Almost surely, 2112031522350 is an apocalyptic number.
112031522350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112031522350 is an abundant number, since it is smaller than the sum of its proper divisors (133230904850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112031522350 is a wasteful number, since it uses less digits than its factorization.
112031522350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12379 (or 12363 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 112031522350 its reverse (53225130211), we get a palindrome (165256652561).
The spelling of 112031522350 in words is "one hundred twelve billion, thirty-one million, five hundred twenty-two thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •