Base | Representation |
---|---|
bin | 1001101001000110001001… |
… | …1010000100101101100101 |
3 | 1101112111122211202120001002 |
4 | 2122101202122010231211 |
5 | 2342144114323214431 |
6 | 34314153254043045 |
7 | 2142641165412602 |
oct | 232214232045545 |
9 | 41474584676032 |
10 | 10601630288741 |
11 | 3418142a06688 |
12 | 1232800649485 |
13 | 5bb96379500b |
14 | 28919bb0d6a9 |
15 | 135b8ce943cb |
hex | 9a462684b65 |
10601630288741 has 2 divisors, whose sum is σ = 10601630288742. Its totient is φ = 10601630288740.
The previous prime is 10601630288729. The next prime is 10601630288749. The reversal of 10601630288741 is 14788203610601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9606931245025 + 994699043716 = 3099505^2 + 997346^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10601630288741 is a prime.
It is a super-2 number, since 2×106016302887412 (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 (10601630288749) 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, 5300815144370 + 5300815144371.
It is an arithmetic number, because the mean of its divisors is an integer number (5300815144371).
Almost surely, 210601630288741 is an apocalyptic number.
It is an amenable number.
10601630288741 is a deficient number, since it is larger than the sum of its proper divisors (1).
10601630288741 is an equidigital number, since it uses as much as digits as its factorization.
10601630288741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 387072, while the sum is 47.
The spelling of 10601630288741 in words is "ten trillion, six hundred one billion, six hundred thirty million, two hundred eighty-eight thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •