Base | Representation |
---|---|
bin | 1001001110011001101101… |
… | …0111001110001111110111 |
3 | 1022220122220210202121212111 |
4 | 2103212123113032033313 |
5 | 2312140403212421012 |
6 | 33323350245031451 |
7 | 2064544412241244 |
oct | 223463327161767 |
9 | 38818823677774 |
10 | 10143024342007 |
11 | 32606a58a4067 |
12 | 11799523b5587 |
13 | 5876384755ab |
14 | 270cd429c5cb |
15 | 128c9b415ba7 |
hex | 9399b5ce3f7 |
10143024342007 has 2 divisors, whose sum is σ = 10143024342008. Its totient is φ = 10143024342006.
The previous prime is 10143024341993. The next prime is 10143024342029. The reversal of 10143024342007 is 70024342034101.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10143024342007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10143024342007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10143024342907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071512171003 + 5071512171004.
It is an arithmetic number, because the mean of its divisors is an integer number (5071512171004).
Almost surely, 210143024342007 is an apocalyptic number.
10143024342007 is a deficient number, since it is larger than the sum of its proper divisors (1).
10143024342007 is an equidigital number, since it uses as much as digits as its factorization.
10143024342007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 31.
Adding to 10143024342007 its reverse (70024342034101), we get a palindrome (80167366376108).
The spelling of 10143024342007 in words is "ten trillion, one hundred forty-three billion, twenty-four million, three hundred forty-two thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •