Base | Representation |
---|---|
bin | 110100010011001000… |
… | …1101001110010101010 |
3 | 101201220011112202201211 |
4 | 1220212101221302222 |
5 | 3320003143432110 |
6 | 123332313103334 |
7 | 11054115253015 |
oct | 1504621516252 |
9 | 351804482654 |
10 | 112311311530 |
11 | 436a3897730 |
12 | 199249b7b4a |
13 | a78b302872 |
14 | 561615837c |
15 | 2dc4ea098a |
hex | 1a26469caa |
112311311530 has 16 divisors (see below), whose sum is σ = 220538575584. Its totient is φ = 40840476880.
The previous prime is 112311311503. The next prime is 112311311557. The reversal of 112311311530 is 35113113211.
It is an interprime number because it is at equal distance from previous prime (112311311503) and next prime (112311311557).
It is a super-2 number, since 2×1123113115302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
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, 510505852 + ... + 510506071.
It is an arithmetic number, because the mean of its divisors is an integer number (13783660974).
Almost surely, 2112311311530 is an apocalyptic number.
112311311530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112311311530 is a deficient number, since it is larger than the sum of its proper divisors (108227264054).
112311311530 is a wasteful number, since it uses less digits than its factorization.
112311311530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021011941.
The product of its (nonzero) digits is 270, while the sum is 22.
Adding to 112311311530 its reverse (35113113211), we get a palindrome (147424424741).
The spelling of 112311311530 in words is "one hundred twelve billion, three hundred eleven million, three hundred eleven thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •