Base | Representation |
---|---|
bin | 100010000001011… |
… | …1010001010111001 |
3 | 2221120010221221220 |
4 | 1010002322022321 |
5 | 4314223110431 |
6 | 305140422253 |
7 | 40201360326 |
oct | 10402721271 |
9 | 2846127856 |
10 | 1141613241 |
11 | 536457a1a |
12 | 27a3a7989 |
13 | 1526908c2 |
14 | ab891b4d |
15 | 6a355b96 |
hex | 440ba2b9 |
1141613241 has 4 divisors (see below), whose sum is σ = 1522150992. Its totient is φ = 761075492.
The previous prime is 1141613237. The next prime is 1141613251. The reversal of 1141613241 is 1423161411.
It is a happy number.
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 1141613241 - 22 = 1141613237 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1141613251) 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 3 ways as a sum of consecutive naturals, for example, 190268871 + ... + 190268876.
It is an arithmetic number, because the mean of its divisors is an integer number (380537748).
Almost surely, 21141613241 is an apocalyptic number.
It is an amenable number.
1141613241 is a deficient number, since it is larger than the sum of its proper divisors (380537751).
1141613241 is an equidigital number, since it uses as much as digits as its factorization.
1141613241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380537750.
The product of its digits is 576, while the sum is 24.
The square root of 1141613241 is about 33787.7676238014. The cubic root of 1141613241 is about 1045.1364613504.
Adding to 1141613241 its reverse (1423161411), we get a palindrome (2564774652).
The spelling of 1141613241 in words is "one billion, one hundred forty-one million, six hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •