Base | Representation |
---|---|
bin | 10010110000000100101101… |
… | …00111101010000101110101 |
3 | 12101222221201012110121122121 |
4 | 21120002112213222011311 |
5 | 20401040132013120041 |
6 | 223410422544355541 |
7 | 11454034144444600 |
oct | 1130022647520565 |
9 | 171887635417577 |
10 | 41234213020021 |
11 | 1215837130451a |
12 | 475b572615bb1 |
13 | 1a014a60315c8 |
14 | a27a647b3337 |
15 | 4b78e33337d1 |
hex | 2580969ea175 |
41234213020021 has 6 divisors (see below), whose sum is σ = 47966329431510. Its totient is φ = 35343611159976.
The previous prime is 41234213019977. The next prime is 41234213020027. The reversal of 41234213020021 is 12002031243214.
It can be written as a sum of positive squares in only one way, i.e., 30943520036100 + 10290692983921 = 5562690^2 + 3207911^2 .
It is not a de Polignac number, because 41234213020021 - 221 = 41234210922869 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41234213020027) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 420757275666 + ... + 420757275763.
It is an arithmetic number, because the mean of its divisors is an integer number (7994388238585).
Almost surely, 241234213020021 is an apocalyptic number.
It is an amenable number.
41234213020021 is a deficient number, since it is larger than the sum of its proper divisors (6732116411489).
41234213020021 is an equidigital number, since it uses as much as digits as its factorization.
41234213020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841514551443 (or 841514551436 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 41234213020021 its reverse (12002031243214), we get a palindrome (53236244263235).
The spelling of 41234213020021 in words is "forty-one trillion, two hundred thirty-four billion, two hundred thirteen million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •