Base | Representation |
---|---|
bin | 1001010100000101011000… |
… | …0010100011100011001111 |
3 | 1100020222220012021111220121 |
4 | 2111001112002203203033 |
5 | 2320240320224403033 |
6 | 33440253154125411 |
7 | 2104601512620100 |
oct | 225012602434317 |
9 | 40228805244817 |
10 | 10240645544143 |
11 | 3299040489113 |
12 | 1194857580867 |
13 | 5938c51b0a21 |
14 | 27591541c3a7 |
15 | 12b5b18b662d |
hex | 950560a38cf |
10240645544143 has 12 divisors (see below), whose sum is σ = 12430526269680. Its totient is φ = 8396057215392.
The previous prime is 10240645544123. The next prime is 10240645544149. The reversal of 10240645544143 is 34144554604201.
It is not a de Polignac number, because 10240645544143 - 225 = 10240611989711 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 10240645544143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10240645544149) 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 11 ways as a sum of consecutive naturals, for example, 4543319878 + ... + 4543322131.
It is an arithmetic number, because the mean of its divisors is an integer number (1035877189140).
Almost surely, 210240645544143 is an apocalyptic number.
10240645544143 is a deficient number, since it is larger than the sum of its proper divisors (2189880725537).
10240645544143 is an equidigital number, since it uses as much as digits as its factorization.
10240645544143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9086642046 (or 9086642039 counting only the distinct ones).
The product of its (nonzero) digits is 921600, while the sum is 43.
The spelling of 10240645544143 in words is "ten trillion, two hundred forty billion, six hundred forty-five million, five hundred forty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •