Base | Representation |
---|---|
bin | 100111111000110001100… |
… | …110001000111001011001 |
3 | 100201001001110222221200002 |
4 | 213320301212020321121 |
5 | 324402102412410340 |
6 | 5455112513222345 |
7 | 402014026626356 |
oct | 47706146107131 |
9 | 10631043887602 |
10 | 2741021216345 |
11 | 967508022475 |
12 | 38328a5619b5 |
13 | 16b62850b999 |
14 | 96947c3362d |
15 | 4b47853e715 |
hex | 27e31988e59 |
2741021216345 has 8 divisors (see below), whose sum is σ = 3289253169480. Its totient is φ = 2192798499840.
The previous prime is 2741021216243. The next prime is 2741021216359. The reversal of 2741021216345 is 5436121201472.
2741021216345 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 471958008064 + 2269063208281 = 686992^2 + 1506341^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2741021216345 - 230 = 2739947474521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2741021216299 and 2741021216308.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1638590 + ... + 2857799.
It is an arithmetic number, because the mean of its divisors is an integer number (411156646185).
Almost surely, 22741021216345 is an apocalyptic number.
It is an amenable number.
2741021216345 is a deficient number, since it is larger than the sum of its proper divisors (548231953135).
2741021216345 is a wasteful number, since it uses less digits than its factorization.
2741021216345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4618315.
The product of its (nonzero) digits is 80640, while the sum is 38.
The spelling of 2741021216345 in words is "two trillion, seven hundred forty-one billion, twenty-one million, two hundred sixteen thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •