Base | Representation |
---|---|
bin | 100111111001010101011… |
… | …000111011100010111001 |
3 | 100201002121022222101102110 |
4 | 213321111120323202321 |
5 | 324404320130433221 |
6 | 5455252244322533 |
7 | 402034641141414 |
oct | 47712530734271 |
9 | 10632538871373 |
10 | 2741621733561 |
11 | 967795aa3997 |
12 | 3834176a3449 |
13 | 16b6c2a58b09 |
14 | 969a38b2b7b |
15 | 4b4b1110776 |
hex | 27e5563b8b9 |
2741621733561 has 8 divisors (see below), whose sum is σ = 3655867593280. Its totient is φ = 1827561848112.
The previous prime is 2741621733553. The next prime is 2741621733593. The reversal of 2741621733561 is 1653371261472.
2741621733561 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2741621733561 - 23 = 2741621733553 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2741621733561.
It is not an unprimeable number, because it can be changed into a prime (2741621733541) 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, 46459165 + ... + 46518138.
It is an arithmetic number, because the mean of its divisors is an integer number (456983449160).
Almost surely, 22741621733561 is an apocalyptic number.
It is an amenable number.
2741621733561 is a deficient number, since it is larger than the sum of its proper divisors (914245859719).
2741621733561 is an equidigital number, since it uses as much as digits as its factorization.
2741621733561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92987135.
The product of its digits is 1270080, while the sum is 48.
The spelling of 2741621733561 in words is "two trillion, seven hundred forty-one billion, six hundred twenty-one million, seven hundred thirty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •