Base | Representation |
---|---|
bin | 100110100000111010… |
… | …100100100010001101 |
3 | 10221202001121220112011 |
4 | 212200322210202031 |
5 | 1134143212223341 |
6 | 30555320341221 |
7 | 2662541502211 |
oct | 464072444215 |
9 | 127661556464 |
10 | 41354414221 |
11 | 165a154153a |
12 | 8021614811 |
13 | 3b9085cbb3 |
14 | 2004414941 |
15 | 1120874b81 |
hex | 9a0ea488d |
41354414221 has 6 divisors (see below), whose sum is σ = 41980861230. Its totient is φ = 40737179736.
The previous prime is 41354414203. The next prime is 41354414239. The reversal of 41354414221 is 12241445314.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (41354414203) and next prime (41354414239).
It can be written as a sum of positive squares in only one way, i.e., 35622410121 + 5732004100 = 188739^2 + 75710^2 .
It is not a de Polignac number, because 41354414221 - 211 = 41354412173 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 (41354414281) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4601706 + ... + 4610683.
It is an arithmetic number, because the mean of its divisors is an integer number (6996810205).
Almost surely, 241354414221 is an apocalyptic number.
It is an amenable number.
41354414221 is a deficient number, since it is larger than the sum of its proper divisors (626447009).
41354414221 is an frugal number, since it uses more digits than its factorization.
41354414221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9212523 (or 9212456 counting only the distinct ones).
The product of its digits is 15360, while the sum is 31.
Adding to 41354414221 its reverse (12241445314), we get a palindrome (53595859535).
The spelling of 41354414221 in words is "forty-one billion, three hundred fifty-four million, four hundred fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •