Base | Representation |
---|---|
bin | 100001010110100… |
… | …1011110100001111 |
3 | 2212222212021000200 |
4 | 1002231023310033 |
5 | 4243000004020 |
6 | 303015024543 |
7 | 36506354100 |
oct | 10255136417 |
9 | 2788767020 |
10 | 1119141135 |
11 | 5247a9332 |
12 | 27296b153 |
13 | 14ab231b8 |
14 | a88c23a7 |
15 | 683b7590 |
hex | 42b4bd0f |
1119141135 has 72 divisors (see below), whose sum is σ = 2375408880. Its totient is φ = 484662528.
The previous prime is 1119141119. The next prime is 1119141143. The reversal of 1119141135 is 5311419111.
It is not a de Polignac number, because 1119141135 - 24 = 1119141119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1119141099 and 1119141108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 28539 + ... + 55251.
It is an arithmetic number, because the mean of its divisors is an integer number (32991790).
Almost surely, 21119141135 is an apocalyptic number.
1119141135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1119141135 is an abundant number, since it is smaller than the sum of its proper divisors (1256267745).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1119141135 is a wasteful number, since it uses less digits than its factorization.
1119141135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26757 (or 26747 counting only the distinct ones).
The product of its digits is 540, while the sum is 27.
The square root of 1119141135 is about 33453.5668501880. The cubic root of 1119141135 is about 1038.2332970438.
It can be divided in two parts, 11191 and 41135, that added together give a triangular number (52326 = T323).
The spelling of 1119141135 in words is "one billion, one hundred nineteen million, one hundred forty-one thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •