Base | Representation |
---|---|
bin | 10010110100111011110010… |
… | …00101110011100111110011 |
3 | 12102120220210022001212120020 |
4 | 21122131321011303213303 |
5 | 20411304200130101233 |
6 | 224015243012214523 |
7 | 11502065600614611 |
oct | 1132357105634763 |
9 | 172526708055506 |
10 | 41401221331443 |
11 | 12212183128796 |
12 | 4787a0130a443 |
13 | 1a1417022425c |
14 | a31b88da86b1 |
15 | 4bbe1a1cc9b3 |
hex | 25a7791739f3 |
41401221331443 has 4 divisors (see below), whose sum is σ = 55201628441928. Its totient is φ = 27600814220960.
The previous prime is 41401221331423. The next prime is 41401221331469. The reversal of 41401221331443 is 34413312210414.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 41401221331443 - 210 = 41401221330419 is a prime.
It is a super-2 number, since 2×414012213314432 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (41401221331403) 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, 6900203555238 + ... + 6900203555243.
It is an arithmetic number, because the mean of its divisors is an integer number (13800407110482).
Almost surely, 241401221331443 is an apocalyptic number.
41401221331443 is a deficient number, since it is larger than the sum of its proper divisors (13800407110485).
41401221331443 is a wasteful number, since it uses less digits than its factorization.
41401221331443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13800407110484.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 41401221331443 its reverse (34413312210414), we get a palindrome (75814533541857).
The spelling of 41401221331443 in words is "forty-one trillion, four hundred one billion, two hundred twenty-one million, three hundred thirty-one thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •