Base | Representation |
---|---|
bin | 10000001010000011110… |
… | …100111000111000010111 |
3 | 10221010220122020202021200 |
4 | 100022003310320320113 |
5 | 121142410142222020 |
6 | 2210023150043543 |
7 | 143134411560606 |
oct | 20120364707027 |
9 | 3833818222250 |
10 | 1110313242135 |
11 | 3989769744a9 |
12 | 15b2297a95b3 |
13 | 8091864ba06 |
14 | 3ba4d089a3d |
15 | 1dd360d6590 |
hex | 10283d38e17 |
1110313242135 has 48 divisors (see below), whose sum is σ = 2038495421664. Its totient is φ = 557130203136.
The previous prime is 1110313242029. The next prime is 1110313242151. The reversal of 1110313242135 is 5312423130111.
1110313242135 is a `hidden beast` number, since 1 + 1 + 103 + 132 + 421 + 3 + 5 = 666.
It is not a de Polignac number, because 1110313242135 - 29 = 1110313241623 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1110313242099 and 1110313242108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1842444 + ... + 2369646.
It is an arithmetic number, because the mean of its divisors is an integer number (42468654618).
Almost surely, 21110313242135 is an apocalyptic number.
1110313242135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1110313242135 is a deficient number, since it is larger than the sum of its proper divisors (928182179529).
1110313242135 is a wasteful number, since it uses less digits than its factorization.
1110313242135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 529984 (or 529981 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 1110313242135 its reverse (5312423130111), we get a palindrome (6422736372246).
The spelling of 1110313242135 in words is "one trillion, one hundred ten billion, three hundred thirteen million, two hundred forty-two thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •