Base | Representation |
---|---|
bin | 1001001110010111011011… |
… | …1000001000011000001001 |
3 | 1022220121100010221011222102 |
4 | 2103211312320020120021 |
5 | 2312133130011233341 |
6 | 33323205421003145 |
7 | 2064523300230656 |
oct | 223456670103011 |
9 | 38817303834872 |
10 | 10142412211721 |
11 | 3260411310569 |
12 | 11798013b34b5 |
13 | 58756b6c061a |
14 | 270c76c78c2d |
15 | 128c627edc9b |
hex | 93976e08609 |
10142412211721 has 2 divisors, whose sum is σ = 10142412211722. Its totient is φ = 10142412211720.
The previous prime is 10142412211661. The next prime is 10142412211739. The reversal of 10142412211721 is 12711221424101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8142097006096 + 2000315205625 = 2853436^2 + 1414325^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10142412211721 is a prime.
It is not a weakly prime, because it can be changed into another prime (10142412211751) 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, 5071206105860 + 5071206105861.
It is an arithmetic number, because the mean of its divisors is an integer number (5071206105861).
Almost surely, 210142412211721 is an apocalyptic number.
It is an amenable number.
10142412211721 is a deficient number, since it is larger than the sum of its proper divisors (1).
10142412211721 is an equidigital number, since it uses as much as digits as its factorization.
10142412211721 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 29.
Adding to 10142412211721 its reverse (12711221424101), we get a palindrome (22853633635822).
The spelling of 10142412211721 in words is "ten trillion, one hundred forty-two billion, four hundred twelve million, two hundred eleven thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •