Base | Representation |
---|---|
bin | 110100001010110010… |
… | …1101000001111101000 |
3 | 101201011122201111200112 |
4 | 1220111211220033220 |
5 | 3313420010213100 |
6 | 123244432153452 |
7 | 11044145432045 |
oct | 1502545501750 |
9 | 351148644615 |
10 | 112031335400 |
11 | 4356a84a4a6 |
12 | 19867098888 |
13 | a7452c600a |
14 | 55cacb81cc |
15 | 2daa5e9b35 |
hex | 1a159683e8 |
112031335400 has 24 divisors (see below), whose sum is σ = 260472855270. Its totient is φ = 44812534080.
The previous prime is 112031335397. The next prime is 112031335417. The reversal of 112031335400 is 4533130211.
It can be written as a sum of positive squares in 3 ways, for example, as 50669109604 + 61362225796 = 225098^2 + 247714^2 .
It is a super-2 number, since 2×1120313354002 (a number of 23 digits) contains 22 as substring.
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 5 ways as a sum of consecutive naturals, for example, 280078139 + ... + 280078538.
Almost surely, 2112031335400 is an apocalyptic number.
112031335400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112031335400 is an abundant number, since it is smaller than the sum of its proper divisors (148441519870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112031335400 is a wasteful number, since it uses less digits than its factorization.
112031335400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560156693 (or 560156684 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 112031335400 its reverse (4533130211), we get a palindrome (116564465611).
The spelling of 112031335400 in words is "one hundred twelve billion, thirty-one million, three hundred thirty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •