Base | Representation |
---|---|
bin | 100111111001010101000… |
… | …011001001001000011001 |
3 | 100201002120221020012200200 |
4 | 213321111003021020121 |
5 | 324404312200201131 |
6 | 5455251522052413 |
7 | 402034541452641 |
oct | 47712503111031 |
9 | 10632527205620 |
10 | 2741616022041 |
11 | 967792852826 |
12 | 3834157aa109 |
13 | 16b6c1809210 |
14 | 969a2c27521 |
15 | 4b4b08832e6 |
hex | 27e550c9219 |
2741616022041 has 48 divisors (see below), whose sum is σ = 4320853555200. Its totient is φ = 1664969095296.
The previous prime is 2741616022009. The next prime is 2741616022097. The reversal of 2741616022041 is 1402206161472.
2741616022041 is a `hidden beast` number, since 2 + 7 + 4 + 1 + 6 + 1 + 602 + 2 + 0 + 41 = 666.
It is not a de Polignac number, because 2741616022041 - 25 = 2741616022009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2741616021987 and 2741616022005.
It is not an unprimeable number, because it can be changed into a prime (2741616020041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18903640 + ... + 19048118.
It is an arithmetic number, because the mean of its divisors is an integer number (90017782400).
Almost surely, 22741616022041 is an apocalyptic number.
It is an amenable number.
2741616022041 is a deficient number, since it is larger than the sum of its proper divisors (1579237533159).
2741616022041 is a wasteful number, since it uses less digits than its factorization.
2741616022041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146630 (or 146627 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The spelling of 2741616022041 in words is "two trillion, seven hundred forty-one billion, six hundred sixteen million, twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •