Base | Representation |
---|---|
bin | 10010110010101111111101… |
… | …00111110011110010110001 |
3 | 12102022202000121021001100002 |
4 | 21121113332213303302301 |
5 | 20404041424431002231 |
6 | 223520550000235345 |
7 | 11463500401555250 |
oct | 1131277647636261 |
9 | 172282017231302 |
10 | 41326152203441 |
11 | 12193360603836 |
12 | 477535090bb55 |
13 | 1a0a0688263a1 |
14 | a2c2a7058797 |
15 | 4b9ec4a5d0cb |
hex | 2595fe9f3cb1 |
41326152203441 has 8 divisors (see below), whose sum is σ = 47230882905024. Its totient is φ = 35421670170000.
The previous prime is 41326152203419. The next prime is 41326152203519. The reversal of 41326152203441 is 14430225162314.
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 41326152203441 - 222 = 41326148009137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41326152203395 and 41326152203404.
It is not an unprimeable number, because it can be changed into a prime (41326152202441) 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, 61810775 + ... + 62475788.
It is an arithmetic number, because the mean of its divisors is an integer number (5903860363128).
Almost surely, 241326152203441 is an apocalyptic number.
It is an amenable number.
41326152203441 is a deficient number, since it is larger than the sum of its proper divisors (5904730701583).
41326152203441 is a wasteful number, since it uses less digits than its factorization.
41326152203441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124334071.
The product of its (nonzero) digits is 138240, while the sum is 38.
Adding to 41326152203441 its reverse (14430225162314), we get a palindrome (55756377365755).
The spelling of 41326152203441 in words is "forty-one trillion, three hundred twenty-six billion, one hundred fifty-two million, two hundred three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •