Base | Representation |
---|---|
bin | 1001011011010001011011… |
… | …1100111100111011011001 |
3 | 1100200210122211001220220112 |
4 | 2112310112330330323121 |
5 | 2324301230114142301 |
6 | 34013115401534105 |
7 | 2116533036221561 |
oct | 226642674747331 |
9 | 40623584056815 |
10 | 10364141162201 |
11 | 3336453547882 |
12 | 11b4781aa4335 |
13 | 5a244665c038 |
14 | 27b8acb01da1 |
15 | 12e8dd6b09bb |
hex | 96d16f3ced9 |
10364141162201 has 2 divisors, whose sum is σ = 10364141162202. Its totient is φ = 10364141162200.
The previous prime is 10364141162189. The next prime is 10364141162213. The reversal of 10364141162201 is 10226114146301.
It is a balanced prime because it is at equal distance from previous prime (10364141162189) and next prime (10364141162213).
It can be written as a sum of positive squares in only one way, i.e., 7152522336400 + 3211618825801 = 2674420^2 + 1792099^2 .
It is a cyclic number.
It is not a de Polignac number, because 10364141162201 - 210 = 10364141161177 is a prime.
It is a super-3 number, since 3×103641411622013 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10364141162231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5182070581100 + 5182070581101.
It is an arithmetic number, because the mean of its divisors is an integer number (5182070581101).
Almost surely, 210364141162201 is an apocalyptic number.
It is an amenable number.
10364141162201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10364141162201 is an equidigital number, since it uses as much as digits as its factorization.
10364141162201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 32.
The spelling of 10364141162201 in words is "ten trillion, three hundred sixty-four billion, one hundred forty-one million, one hundred sixty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •