Base | Representation |
---|---|
bin | 10010101111110101100011… |
… | …01101010001011100000011 |
3 | 12101222011201020010112001021 |
4 | 21113322301231101130003 |
5 | 20400422001322322042 |
6 | 223402555405050311 |
7 | 11453325430150321 |
oct | 1127726155213403 |
9 | 171864636115037 |
10 | 41226077542147 |
11 | 12154977013593 |
12 | 4759a81b56997 |
13 | 1a007aa705584 |
14 | a274d2120d11 |
15 | 4b75b8ec6867 |
hex | 257eb1b51703 |
41226077542147 has 8 divisors (see below), whose sum is σ = 41516322999552. Its totient is φ = 40936607107200.
The previous prime is 41226077542081. The next prime is 41226077542151. The reversal of 41226077542147 is 74124577062214.
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 41226077542147 - 27 = 41226077542019 is a prime.
It is a super-2 number, since 2×412260775421472 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41226077542094 and 41226077542103.
It is not an unprimeable number, because it can be changed into a prime (41226077342147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 193648854 + ... + 193861627.
It is an arithmetic number, because the mean of its divisors is an integer number (5189540374944).
Almost surely, 241226077542147 is an apocalyptic number.
41226077542147 is a deficient number, since it is larger than the sum of its proper divisors (290245457405).
41226077542147 is a wasteful number, since it uses less digits than its factorization.
41226077542147 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 387511229.
The product of its (nonzero) digits is 5268480, while the sum is 52.
The spelling of 41226077542147 in words is "forty-one trillion, two hundred twenty-six billion, seventy-seven million, five hundred forty-two thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •