Base | Representation |
---|---|
bin | 110010000100101110000… |
… | …001110110001101110001 |
3 | 110011221221001210111200101 |
4 | 302010232001312031301 |
5 | 422334223001241431 |
6 | 11152443055352401 |
7 | 503415130146460 |
oct | 62045601661561 |
9 | 13157831714611 |
10 | 3441041040241 |
11 | 1107378a61052 |
12 | 476a91822701 |
13 | 1bc647ac9b2c |
14 | bc793a189d7 |
15 | 5e799210961 |
hex | 3212e076371 |
3441041040241 has 4 divisors (see below), whose sum is σ = 3932618331712. Its totient is φ = 2949463748772.
The previous prime is 3441041040179. The next prime is 3441041040247. The reversal of 3441041040241 is 1420401401443.
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 3441041040241 - 27 = 3441041040113 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3441041040247) 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 3 ways as a sum of consecutive naturals, for example, 245788645725 + ... + 245788645738.
It is an arithmetic number, because the mean of its divisors is an integer number (983154582928).
Almost surely, 23441041040241 is an apocalyptic number.
It is an amenable number.
3441041040241 is a deficient number, since it is larger than the sum of its proper divisors (491577291471).
3441041040241 is an equidigital number, since it uses as much as digits as its factorization.
3441041040241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 491577291470.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 3441041040241 its reverse (1420401401443), we get a palindrome (4861442441684).
The spelling of 3441041040241 in words is "three trillion, four hundred forty-one billion, forty-one million, forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •