Base | Representation |
---|---|
bin | 100001101101111… |
… | …1111111000110001 |
3 | 2220211221201220201 |
4 | 1003123333320301 |
5 | 4304120204131 |
6 | 304134035201 |
7 | 40015565203 |
oct | 10333777061 |
9 | 2824851821 |
10 | 1131413041 |
11 | 530720400 |
12 | 276aa8b01 |
13 | 15052bb95 |
14 | aa398773 |
15 | 694dd761 |
hex | 436ffe31 |
1131413041 has 6 divisors (see below), whose sum is σ = 1243619426. Its totient is φ = 1028557200.
The previous prime is 1131413039. The next prime is 1131413069. The reversal of 1131413041 is 1403141311.
It can be written as a sum of positive squares in only one way, i.e., 1115292816 + 16120225 = 33396^2 + 4015^2 .
It is not a de Polignac number, because 1131413041 - 21 = 1131413039 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1131413021) 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 5 ways as a sum of consecutive naturals, for example, 4675140 + ... + 4675381.
Almost surely, 21131413041 is an apocalyptic number.
1131413041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1131413041 is a deficient number, since it is larger than the sum of its proper divisors (112206385).
1131413041 is an equidigital number, since it uses as much as digits as its factorization.
1131413041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9350543 (or 9350532 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 1131413041 is about 33636.4837787781. The cubic root of 1131413041 is about 1042.0144145353.
Adding to 1131413041 its reverse (1403141311), we get a palindrome (2534554352).
The spelling of 1131413041 in words is "one billion, one hundred thirty-one million, four hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •