Base | Representation |
---|---|
bin | 110100001010110011… |
… | …0011011011101000000 |
3 | 101201011200010011102010 |
4 | 1220111212123131000 |
5 | 3313420033421102 |
6 | 123244440452520 |
7 | 11044150264422 |
oct | 1502546333500 |
9 | 351150104363 |
10 | 112031545152 |
11 | 4356a98304a |
12 | 1986717a140 |
13 | a74536a627 |
14 | 55cad30812 |
15 | 2daa63bd6c |
hex | 1a1599b740 |
112031545152 has 56 divisors (see below), whose sum is σ = 296453052000. Its totient is φ = 37339280896.
The previous prime is 112031545099. The next prime is 112031545183. The reversal of 112031545152 is 251545130211.
It is a super-2 number, since 2×1120315451522 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 1777474 + ... + 1839422.
It is an arithmetic number, because the mean of its divisors is an integer number (5293804500).
Almost surely, 2112031545152 is an apocalyptic number.
112031545152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112031545152 is an abundant number, since it is smaller than the sum of its proper divisors (184421506848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112031545152 is an equidigital number, since it uses as much as digits as its factorization.
112031545152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71383 (or 71373 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 112031545152 its reverse (251545130211), we get a palindrome (363576675363).
The spelling of 112031545152 in words is "one hundred twelve billion, thirty-one million, five hundred forty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •