Base | Representation |
---|---|
bin | 1001000110010001010001… |
… | …1101100101001011000101 |
3 | 1022102022022201102000000111 |
4 | 2101210110131211023011 |
5 | 2302343300431144031 |
6 | 33135243541513021 |
7 | 2051500435112653 |
oct | 221442435451305 |
9 | 38368281360014 |
10 | 10003322131141 |
11 | 3207426614349 |
12 | 1156864412771 |
13 | 5774034b8cb1 |
14 | 268240429dd3 |
15 | 1253219181b1 |
hex | 919147652c5 |
10003322131141 has 2 divisors, whose sum is σ = 10003322131142. Its totient is φ = 10003322131140.
The previous prime is 10003322131087. The next prime is 10003322131147. The reversal of 10003322131141 is 14113122330001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8655275740225 + 1348046390916 = 2941985^2 + 1161054^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10003322131141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10003322131147) 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 as a sum of consecutive naturals, namely, 5001661065570 + 5001661065571.
It is an arithmetic number, because the mean of its divisors is an integer number (5001661065571).
Almost surely, 210003322131141 is an apocalyptic number.
It is an amenable number.
10003322131141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10003322131141 is an equidigital number, since it uses as much as digits as its factorization.
10003322131141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10003322131141 its reverse (14113122330001), we get a palindrome (24116444461142).
The spelling of 10003322131141 in words is "ten trillion, three billion, three hundred twenty-two million, one hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •