Base | Representation |
---|---|
bin | 100011001010011110111… |
… | …011100010000000000001 |
3 | 22120000020201110110210121 |
4 | 203022132323202000001 |
5 | 304042331113314431 |
6 | 5050032445100241 |
7 | 336403405215601 |
oct | 43123673420001 |
9 | 8500221413717 |
10 | 2416438026241 |
11 | 8518952a6638 |
12 | 3303a4257681 |
13 | 146b3b622555 |
14 | 84d55c46c01 |
15 | 42ccca92611 |
hex | 2329eee2001 |
2416438026241 has 8 divisors (see below), whose sum is σ = 2418113562984. Its totient is φ = 2414762720640.
The previous prime is 2416438026227. The next prime is 2416438026257. The reversal of 2416438026241 is 1426208346142.
It can be written as a sum of positive squares in 4 ways, for example, as 371495126016 + 2044942900225 = 609504^2 + 1430015^2 .
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 2416438026241 - 25 = 2416438026209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2416438026641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24390381 + ... + 24489253.
It is an arithmetic number, because the mean of its divisors is an integer number (302264195373).
Almost surely, 22416438026241 is an apocalyptic number.
It is an amenable number.
2416438026241 is a deficient number, since it is larger than the sum of its proper divisors (1675536743).
2416438026241 is a wasteful number, since it uses less digits than its factorization.
2416438026241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115571.
The product of its (nonzero) digits is 442368, while the sum is 43.
The spelling of 2416438026241 in words is "two trillion, four hundred sixteen billion, four hundred thirty-eight million, twenty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •