Base | Representation |
---|---|
bin | 100001110001010… |
… | …0111101010101001 |
3 | 2220222012220222121 |
4 | 1003202213222221 |
5 | 4310041230331 |
6 | 304235151241 |
7 | 40036414636 |
oct | 10342475251 |
9 | 2828186877 |
10 | 1133148841 |
11 | 5316a6550 |
12 | 2775a5521 |
13 | 1509b8c96 |
14 | aa6cb18d |
15 | 69732c11 |
hex | 438a7aa9 |
1133148841 has 4 divisors (see below), whose sum is σ = 1236162384. Its totient is φ = 1030135300.
The previous prime is 1133148811. The next prime is 1133148869. The reversal of 1133148841 is 1488413311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1133148841 - 29 = 1133148329 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1133148797 and 1133148806.
It is not an unprimeable number, because it can be changed into a prime (1133148811) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51506755 + ... + 51506776.
It is an arithmetic number, because the mean of its divisors is an integer number (309040596).
Almost surely, 21133148841 is an apocalyptic number.
1133148841 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1133148841 is a deficient number, since it is larger than the sum of its proper divisors (103013543).
1133148841 is a wasteful number, since it uses less digits than its factorization.
1133148841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103013542.
The product of its digits is 9216, while the sum is 34.
The square root of 1133148841 is about 33662.2762302254. The cubic root of 1133148841 is about 1042.5470241619.
The spelling of 1133148841 in words is "one billion, one hundred thirty-three million, one hundred forty-eight thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •