Base | Representation |
---|---|
bin | 10010110010101100100010… |
… | …11111100001000111010001 |
3 | 12102022120022000010012010122 |
4 | 21121112101133201013101 |
5 | 20404024202224010413 |
6 | 223520044154040025 |
7 | 11463404130344030 |
oct | 1131262137410721 |
9 | 172276260105118 |
10 | 41324321313233 |
11 | 12192601070932 |
12 | 4774b1b719015 |
13 | 1a09b3640c0ba |
14 | a2c171c20717 |
15 | 4b9e18e52108 |
hex | 2595917e11d1 |
41324321313233 has 8 divisors (see below), whose sum is σ = 47228055428352. Its totient is φ = 35420652108576.
The previous prime is 41324321313227. The next prime is 41324321313283. The reversal of 41324321313233 is 33231312342314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41324321313233 - 226 = 41324254204369 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41324321313193 and 41324321313202.
It is not an unprimeable number, because it can be changed into a prime (41324321313283) 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, 14855660 + ... + 17416637.
It is an arithmetic number, because the mean of its divisors is an integer number (5903506928544).
Almost surely, 241324321313233 is an apocalyptic number.
It is an amenable number.
41324321313233 is a deficient number, since it is larger than the sum of its proper divisors (5903734115119).
41324321313233 is a wasteful number, since it uses less digits than its factorization.
41324321313233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32455231.
The product of its digits is 93312, while the sum is 35.
Adding to 41324321313233 its reverse (33231312342314), we get a palindrome (74555633655547).
The spelling of 41324321313233 in words is "forty-one trillion, three hundred twenty-four billion, three hundred twenty-one million, three hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •