Base | Representation |
---|---|
bin | 110100001100111010… |
… | …1000111101101010100 |
3 | 101201100121122022102202 |
4 | 1220121311013231110 |
5 | 3314041220132200 |
6 | 123255453424032 |
7 | 11046001400342 |
oct | 1503165075524 |
9 | 351317568382 |
10 | 112102505300 |
11 | 435a6a3a4a5 |
12 | 19886a9b018 |
13 | a756c84196 |
14 | 55d6522992 |
15 | 2db19a71d5 |
hex | 1a19d47b54 |
112102505300 has 36 divisors (see below), whose sum is σ = 244128200316. Its totient is φ = 44681414400.
The previous prime is 112102505269. The next prime is 112102505351. The reversal of 112102505300 is 3505201211.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 10773609616 + 101328895684 = 103796^2 + 318322^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 1966607 + ... + 2022806.
Almost surely, 2112102505300 is an apocalyptic number.
112102505300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112102505300 is an abundant number, since it is smaller than the sum of its proper divisors (132025695016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112102505300 is a wasteful number, since it uses less digits than its factorization.
112102505300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3989708 (or 3989701 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
Adding to 112102505300 its reverse (3505201211), we get a palindrome (115607706511).
The spelling of 112102505300 in words is "one hundred twelve billion, one hundred two million, five hundred five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •