Base | Representation |
---|---|
bin | 10010101111001010110101… |
… | …01111010111010010010001 |
3 | 12101212222111220221101100002 |
4 | 21113211122233113102101 |
5 | 20400033014232323423 |
6 | 223344243551535345 |
7 | 11451554211155444 |
oct | 1127453257272221 |
9 | 171788456841302 |
10 | 41203143636113 |
11 | 12146178467538 |
12 | 475554152a555 |
13 | 19cb594248084 |
14 | a2635831965b |
15 | 4b6bc58c0228 |
hex | 25795abd7491 |
41203143636113 has 4 divisors (see below), whose sum is σ = 41203202296560. Its totient is φ = 41203084975668.
The previous prime is 41203143636101. The next prime is 41203143636121. The reversal of 41203143636113 is 31163634130214.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 41203143636113 - 242 = 36805097125009 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (41203143630113) 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, 28263695 + ... + 29685732.
It is an arithmetic number, because the mean of its divisors is an integer number (10300800574140).
Almost surely, 241203143636113 is an apocalyptic number.
It is an amenable number.
41203143636113 is a deficient number, since it is larger than the sum of its proper divisors (58660447).
41203143636113 is an equidigital number, since it uses as much as digits as its factorization.
41203143636113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58660446.
The product of its (nonzero) digits is 93312, while the sum is 38.
Adding to 41203143636113 its reverse (31163634130214), we get a palindrome (72366777766327).
The spelling of 41203143636113 in words is "forty-one trillion, two hundred three billion, one hundred forty-three million, six hundred thirty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •