Base | Representation |
---|---|
bin | 10010111011010111000100… |
… | …00101010001001010011001 |
3 | 12110101000201120020211111001 |
4 | 21131223202011101022121 |
5 | 20423413402142130243 |
6 | 224304521141305001 |
7 | 11524043415466324 |
oct | 1135534205211231 |
9 | 173330646224431 |
10 | 41622026130073 |
11 | 12297890737044 |
12 | 4802764405161 |
13 | 1a2bc2b89115c |
14 | a3c7341c97bb |
15 | 4c2a3ed91a4d |
hex | 25dae2151299 |
41622026130073 has 4 divisors (see below), whose sum is σ = 41921465167120. Its totient is φ = 41322587093028.
The previous prime is 41622026130019. The next prime is 41622026130089. The reversal of 41622026130073 is 37003162022614.
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 41622026130073 - 29 = 41622026129561 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41622026130973) 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, 149719518315 + ... + 149719518592.
It is an arithmetic number, because the mean of its divisors is an integer number (10480366291780).
Almost surely, 241622026130073 is an apocalyptic number.
It is an amenable number.
41622026130073 is a deficient number, since it is larger than the sum of its proper divisors (299439037047).
41622026130073 is a wasteful number, since it uses less digits than its factorization.
41622026130073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299439037046.
The product of its (nonzero) digits is 72576, while the sum is 37.
Adding to 41622026130073 its reverse (37003162022614), we get a palindrome (78625188152687).
The spelling of 41622026130073 in words is "forty-one trillion, six hundred twenty-two billion, twenty-six million, one hundred thirty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •