Base | Representation |
---|---|
bin | 1001010100000101011000… |
… | …0010011010000100010111 |
3 | 1100020222220012012112122002 |
4 | 2111001112002122010113 |
5 | 2320240320222132203 |
6 | 33440253153225515 |
7 | 2104601512365623 |
oct | 225012602320427 |
9 | 40228805175562 |
10 | 10240645505303 |
11 | 3299040461a14 |
12 | 119485756229b |
13 | 5938c5199145 |
14 | 27591540c183 |
15 | 12b5b18a9d88 |
hex | 9505609a117 |
10240645505303 has 8 divisors (see below), whose sum is σ = 10301260665696. Its totient is φ = 10180074708000.
The previous prime is 10240645505297. The next prime is 10240645505323. The reversal of 10240645505303 is 30350554604201.
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 10240645505303 - 210 = 10240645504279 is a prime.
It is a super-2 number, since 2×102406455053032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10240645505323) 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, 10627676 + ... + 11551137.
It is an arithmetic number, because the mean of its divisors is an integer number (1287657583212).
Almost surely, 210240645505303 is an apocalyptic number.
10240645505303 is a deficient number, since it is larger than the sum of its proper divisors (60615160393).
10240645505303 is a wasteful number, since it uses less digits than its factorization.
10240645505303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22181545.
The product of its (nonzero) digits is 216000, while the sum is 38.
The spelling of 10240645505303 in words is "ten trillion, two hundred forty billion, six hundred forty-five million, five hundred five thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •