Base | Representation |
---|---|
bin | 10000001010000011000… |
… | …110100110111101110101 |
3 | 10221010212210102101022021 |
4 | 100022003012212331311 |
5 | 121142344041011013 |
6 | 2210022034033141 |
7 | 143134203501415 |
oct | 20120306467565 |
9 | 3833783371267 |
10 | 1110301110133 |
11 | 398970038556 |
12 | 15b2257187b1 |
13 | 80915c91907 |
14 | 3ba4b60c645 |
15 | 1dd34edba8d |
hex | 102831a6f75 |
1110301110133 has 16 divisors (see below), whose sum is σ = 1196131046400. Its totient is φ = 1028252816640.
The previous prime is 1110301110131. The next prime is 1110301110143. The reversal of 1110301110133 is 3310111030111.
It is a cyclic number.
It is not a de Polignac number, because 1110301110133 - 21 = 1110301110131 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110301110131) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 5363193 + ... + 5566366.
It is an arithmetic number, because the mean of its divisors is an integer number (74758190400).
Almost surely, 21110301110133 is an apocalyptic number.
It is an amenable number.
1110301110133 is a deficient number, since it is larger than the sum of its proper divisors (85829936267).
1110301110133 is a wasteful number, since it uses less digits than its factorization.
1110301110133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10929732.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 1110301110133 its reverse (3310111030111), we get a palindrome (4420412140244).
The spelling of 1110301110133 in words is "one trillion, one hundred ten billion, three hundred one million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •