Base | Representation |
---|---|
bin | 100001101101011… |
… | …0100000011001101 |
3 | 2220211100221210222 |
4 | 1003122310003031 |
5 | 4304030234123 |
6 | 304123241125 |
7 | 40013132450 |
oct | 10332640315 |
9 | 2824327728 |
10 | 1131102413 |
11 | 530528a91 |
12 | 2769791a5 |
13 | 15045068c |
14 | aa317497 |
15 | 6947b6c8 |
hex | 436b40cd |
1131102413 has 4 divisors (see below), whose sum is σ = 1292688480. Its totient is φ = 969516348.
The previous prime is 1131102407. The next prime is 1131102449. The reversal of 1131102413 is 3142011311.
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 1131102413 - 214 = 1131086029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1131102391 and 1131102400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131102113) 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, 80793023 + ... + 80793036.
It is an arithmetic number, because the mean of its divisors is an integer number (323172120).
Almost surely, 21131102413 is an apocalyptic number.
It is an amenable number.
1131102413 is a deficient number, since it is larger than the sum of its proper divisors (161586067).
1131102413 is an equidigital number, since it uses as much as digits as its factorization.
1131102413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161586066.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 1131102413 is about 33631.8660350567. The cubic root of 1131102413 is about 1041.9190445663.
Adding to 1131102413 its reverse (3142011311), we get a palindrome (4273113724).
The spelling of 1131102413 in words is "one billion, one hundred thirty-one million, one hundred two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •