Base | Representation |
---|---|
bin | 11001101100110011011111… |
… | …100111011100001111100011 |
3 | 112211012120110210000100202021 |
4 | 121230303133213130033203 |
5 | 104303341131410120003 |
6 | 1040221152143002311 |
7 | 32544104343313162 |
oct | 3154633747341743 |
9 | 484176423010667 |
10 | 113030111020003 |
11 | 33018889a88971 |
12 | 10815bab599397 |
13 | 4b0b903197b58 |
14 | 1dca987d013d9 |
15 | d1028c6b02bd |
hex | 66ccdf9dc3e3 |
113030111020003 has 16 divisors (see below), whose sum is σ = 117622081272960. Its totient is φ = 108529590272896.
The previous prime is 113030111019997. The next prime is 113030111020027. The reversal of 113030111020003 is 300020111030311.
It is a cyclic number.
It is not a de Polignac number, because 113030111020003 - 229 = 113029574149091 is a prime.
It is a super-2 number, since 2×1130301110200032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (113030111020703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30734913 + ... + 34215421.
It is an arithmetic number, because the mean of its divisors is an integer number (7351380079560).
Almost surely, 2113030111020003 is an apocalyptic number.
113030111020003 is a deficient number, since it is larger than the sum of its proper divisors (4591970252957).
113030111020003 is a wasteful number, since it uses less digits than its factorization.
113030111020003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3493646.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 113030111020003 its reverse (300020111030311), we get a palindrome (413050222050314).
The spelling of 113030111020003 in words is "one hundred thirteen trillion, thirty billion, one hundred eleven million, twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •