Base | Representation |
---|---|
bin | 10010111011011010000110… |
… | …00001001101001110101101 |
3 | 12110101011220220110201100020 |
4 | 21131231003001031032231 |
5 | 20423430220012032331 |
6 | 224305350355152353 |
7 | 11524131624151365 |
oct | 1135550301151655 |
9 | 173334826421306 |
10 | 41623652455341 |
11 | 12298545759310 |
12 | 4802b38ba56b9 |
13 | 1a2c12a7b33b8 |
14 | a3c84a1b39a5 |
15 | 4c2ad7a40c96 |
hex | 25db4304d3ad |
41623652455341 has 16 divisors (see below), whose sum is σ = 62631201188160. Its totient is φ = 24356578238720.
The previous prime is 41623652455337. The next prime is 41623652455351. The reversal of 41623652455341 is 14355425632614.
41623652455341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 41623652455341 - 22 = 41623652455337 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41623652455351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21746943900 + ... + 21746945813.
It is an arithmetic number, because the mean of its divisors is an integer number (3914450074260).
Almost surely, 241623652455341 is an apocalyptic number.
It is an amenable number.
41623652455341 is a deficient number, since it is larger than the sum of its proper divisors (21007548732819).
41623652455341 is a wasteful number, since it uses less digits than its factorization.
41623652455341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43493889756.
The product of its digits is 10368000, while the sum is 51.
The spelling of 41623652455341 in words is "forty-one trillion, six hundred twenty-three billion, six hundred fifty-two million, four hundred fifty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •