Base | Representation |
---|---|
bin | 100001110011001… |
… | …1010001010100001 |
3 | 2221001002101111110 |
4 | 1003212122022201 |
5 | 4310320021423 |
6 | 304312333533 |
7 | 40051022526 |
oct | 10346321241 |
9 | 2831071443 |
10 | 1134142113 |
11 | 532214835 |
12 | 2779a42a9 |
13 | 150c76110 |
14 | aa8a914d |
15 | 6987c193 |
hex | 4399a2a1 |
1134142113 has 32 divisors (see below), whose sum is σ = 1650087936. Its totient is φ = 688742208.
The previous prime is 1134142111. The next prime is 1134142117. The reversal of 1134142113 is 3112414311.
It is not a de Polignac number, because 1134142113 - 21 = 1134142111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1134142113.
It is not an unprimeable number, because it can be changed into a prime (1134142111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1931806 + ... + 1932392.
It is an arithmetic number, because the mean of its divisors is an integer number (51565248).
Almost surely, 21134142113 is an apocalyptic number.
1134142113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1134142113 is a deficient number, since it is larger than the sum of its proper divisors (515945823).
1134142113 is a wasteful number, since it uses less digits than its factorization.
1134142113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1173.
The product of its digits is 288, while the sum is 21.
The square root of 1134142113 is about 33677.0264869094. The cubic root of 1134142113 is about 1042.8515532490.
Adding to 1134142113 its reverse (3112414311), we get a palindrome (4246556424).
The spelling of 1134142113 in words is "one billion, one hundred thirty-four million, one hundred forty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •