Base | Representation |
---|---|
bin | 111110000100110… |
… | …010001000111101 |
3 | 2200120122200221112 |
4 | 332010302020331 |
5 | 4113102110331 |
6 | 251201411405 |
7 | 34544051063 |
oct | 7604621075 |
9 | 2616580845 |
10 | 1041441341 |
11 | 494959326 |
12 | 250939b65 |
13 | 1379b9aa5 |
14 | 9c458033 |
15 | 6166a32b |
hex | 3e13223d |
1041441341 has 8 divisors (see below), whose sum is σ = 1045191264. Its totient is φ = 1037699280.
The previous prime is 1041441337. The next prime is 1041441353. The reversal of 1041441341 is 1431441401.
1041441341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1041441341 - 22 = 1041441337 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1041441371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 387695 + ... + 390371.
It is an arithmetic number, because the mean of its divisors is an integer number (130648908).
It is a self-describing number.
Almost surely, 21041441341 is an apocalyptic number.
It is an amenable number.
1041441341 is a deficient number, since it is larger than the sum of its proper divisors (3749923).
1041441341 is an equidigital number, since it uses as much as digits as its factorization.
1041441341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3931.
The product of its (nonzero) digits is 768, while the sum is 23.
The square root of 1041441341 is about 32271.3702993846. The cubic root of 1041441341 is about 1013.6272352596.
Adding to 1041441341 its reverse (1431441401), we get a palindrome (2472882742).
The spelling of 1041441341 in words is "one billion, forty-one million, four hundred forty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •