Base | Representation |
---|---|
bin | 1001001101110000101001… |
… | …1101010101001000001101 |
3 | 1022212121110201202022002011 |
4 | 2103130022131111020031 |
5 | 2312000320321442031 |
6 | 33314324510101221 |
7 | 2064004326106654 |
oct | 223341235251015 |
9 | 38777421668064 |
10 | 10132003312141 |
11 | 3256a5a802217 |
12 | 11777974aa811 |
13 | 5865a0096b49 |
14 | 27056a6b619b |
15 | 128853ac06b1 |
hex | 9370a75520d |
10132003312141 has 2 divisors, whose sum is σ = 10132003312142. Its totient is φ = 10132003312140.
The previous prime is 10132003312091. The next prime is 10132003312159. The reversal of 10132003312141 is 14121330023101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6932931238116 + 3199072074025 = 2633046^2 + 1788595^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10132003312141 is a prime.
It is a super-2 number, since 2×101320033121412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10132003382141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066001656070 + 5066001656071.
It is an arithmetic number, because the mean of its divisors is an integer number (5066001656071).
Almost surely, 210132003312141 is an apocalyptic number.
It is an amenable number.
10132003312141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10132003312141 is an equidigital number, since it uses as much as digits as its factorization.
10132003312141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10132003312141 its reverse (14121330023101), we get a palindrome (24253333335242).
The spelling of 10132003312141 in words is "ten trillion, one hundred thirty-two billion, three million, three hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •