Base | Representation |
---|---|
bin | 110100010010110101… |
… | …1100101001010011110 |
3 | 101201212110202201011100 |
4 | 1220211223211022132 |
5 | 3314443120043402 |
6 | 123331315133530 |
7 | 11053634364402 |
oct | 1504553451236 |
9 | 351773681140 |
10 | 112301331102 |
11 | 436991a0244 |
12 | 199215a42a6 |
13 | a789219b9c |
14 | 5614abb102 |
15 | 2dc417d71c |
hex | 1a25ae529e |
112301331102 has 24 divisors (see below), whose sum is σ = 244678884840. Its totient is φ = 37224648720.
The previous prime is 112301331091. The next prime is 112301331139. The reversal of 112301331102 is 201133103211.
112301331102 is a `hidden beast` number, since 1 + 1 + 230 + 1 + 331 + 102 = 666.
It is a super-2 number, since 2×1123013311022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 17424049 + ... + 17430492.
It is an arithmetic number, because the mean of its divisors is an integer number (10194953535).
Almost surely, 2112301331102 is an apocalyptic number.
112301331102 is an abundant number, since it is smaller than the sum of its proper divisors (132377553738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112301331102 is a wasteful number, since it uses less digits than its factorization.
112301331102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34854728 (or 34854725 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 112301331102 its reverse (201133103211), we get a palindrome (313434434313).
The spelling of 112301331102 in words is "one hundred twelve billion, three hundred one million, three hundred thirty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •