Base | Representation |
---|---|
bin | 10010111011111011101000… |
… | …11011111101101101110011 |
3 | 12110102220101222112000221002 |
4 | 21131331310123331231303 |
5 | 20424224110311004301 |
6 | 224321525401552215 |
7 | 11525340121641566 |
oct | 1135756433755563 |
9 | 173386358460832 |
10 | 41641661422451 |
11 | 122a5147305902 |
12 | 48065241a566b |
13 | 1a30a3a83335c |
14 | a3d677c964dd |
15 | 4c32ddabb16b |
hex | 25df746fdb73 |
41641661422451 has 8 divisors (see below), whose sum is σ = 41726622439824. Its totient is φ = 41556781749600.
The previous prime is 41641661422393. The next prime is 41641661422469. The reversal of 41641661422451 is 15422416614614.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 41641661422451 - 210 = 41641661421427 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41641661422396 and 41641661422405.
It is not an unprimeable number, because it can be changed into a prime (41641661322451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19311200 + ... + 21358973.
It is an arithmetic number, because the mean of its divisors is an integer number (5215827804978).
Almost surely, 241641661422451 is an apocalyptic number.
41641661422451 is a deficient number, since it is larger than the sum of its proper divisors (84961017373).
41641661422451 is a wasteful number, since it uses less digits than its factorization.
41641661422451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40672261.
The product of its digits is 1105920, while the sum is 47.
The spelling of 41641661422451 in words is "forty-one trillion, six hundred forty-one billion, six hundred sixty-one million, four hundred twenty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •