Base | Representation |
---|---|
bin | 100001001011100001100… |
… | …001110110101001000011 |
3 | 22001222101020022002212201 |
4 | 201023201201312221003 |
5 | 244324134300240133 |
6 | 4503245423534031 |
7 | 323506260514105 |
oct | 41134141665103 |
9 | 8058336262781 |
10 | 2280116415043 |
11 | 7a9aa0301445 |
12 | 309a9a45a317 |
13 | 137024b5859c |
14 | 7c502d71575 |
15 | 3e49ec68d7d |
hex | 212e1876a43 |
2280116415043 has 4 divisors (see below), whose sum is σ = 2358741119040. Its totient is φ = 2201491711048.
The previous prime is 2280116415041. The next prime is 2280116415077. The reversal of 2280116415043 is 3405146110822.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2280116415043 - 21 = 2280116415041 is a prime.
It is a super-3 number, since 3×22801164150433 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2280116414993 and 2280116415011.
It is not an unprimeable number, because it can be changed into a prime (2280116415041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39312351955 + ... + 39312352012.
It is an arithmetic number, because the mean of its divisors is an integer number (589685279760).
Almost surely, 22280116415043 is an apocalyptic number.
2280116415043 is a deficient number, since it is larger than the sum of its proper divisors (78624703997).
2280116415043 is an equidigital number, since it uses as much as digits as its factorization.
2280116415043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78624703996.
The product of its (nonzero) digits is 46080, while the sum is 37.
The spelling of 2280116415043 in words is "two trillion, two hundred eighty billion, one hundred sixteen million, four hundred fifteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •