Base | Representation |
---|---|
bin | 110100101010111100… |
… | …0100001011100011111 |
3 | 101210221211110212122111 |
4 | 1221111320201130133 |
5 | 3323122131430421 |
6 | 123543444254451 |
7 | 11112654251431 |
oct | 1512570413437 |
9 | 353854425574 |
10 | 113110030111 |
11 | 43a73732831 |
12 | 19b083a1427 |
13 | a887927400 |
14 | 569026c651 |
15 | 2e20172ee1 |
hex | 1a55e2171f |
113110030111 has 12 divisors (see below), whose sum is σ = 129684806352. Its totient is φ = 98267534976.
The previous prime is 113110030087. The next prime is 113110030133. The reversal of 113110030111 is 111030011311.
It is not a de Polignac number, because 113110030111 - 225 = 113076475679 is a prime.
It is a super-2 number, since 2×1131100301112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113110030091 and 113110030100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113110030151) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19682131 + ... + 19687876.
It is an arithmetic number, because the mean of its divisors is an integer number (10807067196).
Almost surely, 2113110030111 is an apocalyptic number.
113110030111 is a deficient number, since it is larger than the sum of its proper divisors (16574776241).
113110030111 is a wasteful number, since it uses less digits than its factorization.
113110030111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39370050 (or 39370037 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 113110030111 its reverse (111030011311), we get a palindrome (224140041422).
The spelling of 113110030111 in words is "one hundred thirteen billion, one hundred ten million, thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •