Base | Representation |
---|---|
bin | 10010110010111001100110… |
… | …10100000111111111000011 |
3 | 12102100020101112110111010222 |
4 | 21121130303110013333003 |
5 | 20404133031241444021 |
6 | 223523203524213255 |
7 | 11464042626413333 |
oct | 1131346324077703 |
9 | 172306345414128 |
10 | 41331331203011 |
11 | 12195578a5a873 |
12 | 477635723a22b |
13 | 1a0a6b2798685 |
14 | a2c638bd30c3 |
15 | 4ba1c95716ab |
hex | 259733507fc3 |
41331331203011 has 4 divisors (see below), whose sum is σ = 41697095196072. Its totient is φ = 40965567209952.
The previous prime is 41331331202983. The next prime is 41331331203061. The reversal of 41331331203011 is 11030213313314.
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 41331331203011 - 222 = 41331327008707 is a prime.
It is a super-2 number, since 2×413313312030112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41331331203061) 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, 182881996361 + ... + 182881996586.
It is an arithmetic number, because the mean of its divisors is an integer number (10424273799018).
Almost surely, 241331331203011 is an apocalyptic number.
41331331203011 is a deficient number, since it is larger than the sum of its proper divisors (365763993061).
41331331203011 is a wasteful number, since it uses less digits than its factorization.
41331331203011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365763993060.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 41331331203011 its reverse (11030213313314), we get a palindrome (52361544516325).
The spelling of 41331331203011 in words is "forty-one trillion, three hundred thirty-one billion, three hundred thirty-one million, two hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •