Base | Representation |
---|---|
bin | 100001011111000110101… |
… | …001010001000100110101 |
3 | 22010222122102021112202012 |
4 | 201133012221101010311 |
5 | 300200213343204343 |
6 | 4521043524454005 |
7 | 325152254024633 |
oct | 41370651210465 |
9 | 8128572245665 |
10 | 2301140209973 |
11 | 8079a9726780 |
12 | 311b8724a305 |
13 | 138cc5681c27 |
14 | 7d5391da353 |
15 | 3ecd0816718 |
hex | 217c6a51135 |
2301140209973 has 8 divisors (see below), whose sum is σ = 2510959439520. Its totient is φ = 2091425091280.
The previous prime is 2301140209967. The next prime is 2301140209999. The reversal of 2301140209973 is 3799020411032.
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 2301140209973 - 218 = 2301139947829 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 2301140209973.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2301140209903) 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 7 ways as a sum of consecutive naturals, for example, 25981490 + ... + 26069907.
It is an arithmetic number, because the mean of its divisors is an integer number (313869929940).
Almost surely, 22301140209973 is an apocalyptic number.
It is an amenable number.
2301140209973 is a deficient number, since it is larger than the sum of its proper divisors (209819229547).
2301140209973 is a wasteful number, since it uses less digits than its factorization.
2301140209973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52055427.
The product of its (nonzero) digits is 81648, while the sum is 41.
The spelling of 2301140209973 in words is "two trillion, three hundred one billion, one hundred forty million, two hundred nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •