Base | Representation |
---|---|
bin | 10000001001110111111… |
… | …001000100110100101001 |
3 | 10221010101200111001121000 |
4 | 100021313321010310221 |
5 | 121142002412404113 |
6 | 2205551234305213 |
7 | 143126430630363 |
oct | 20116771046451 |
9 | 3833350431530 |
10 | 1110113013033 |
11 | 398883945402 |
12 | 15b192728209 |
13 | 808b601435b |
14 | 3ba30647d33 |
15 | 1dd23734373 |
hex | 10277e44d29 |
1110113013033 has 8 divisors (see below), whose sum is σ = 1644611871200. Its totient is φ = 740075342004.
The previous prime is 1110113013019. The next prime is 1110113013049. The reversal of 1110113013033 is 3303103110111.
It is not a de Polignac number, because 1110113013033 - 210 = 1110113012009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110113012997 and 1110113013015.
It is not an unprimeable number, because it can be changed into a prime (1110113013073) 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 7 ways as a sum of consecutive naturals, for example, 20557648363 + ... + 20557648416.
It is an arithmetic number, because the mean of its divisors is an integer number (205576483900).
Almost surely, 21110113013033 is an apocalyptic number.
It is an amenable number.
1110113013033 is a deficient number, since it is larger than the sum of its proper divisors (534498858167).
1110113013033 is an equidigital number, since it uses as much as digits as its factorization.
1110113013033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41115296788 (or 41115296782 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
Adding to 1110113013033 its reverse (3303103110111), we get a palindrome (4413216123144).
The spelling of 1110113013033 in words is "one trillion, one hundred ten billion, one hundred thirteen million, thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.163 sec. • engine limits •