Base | Representation |
---|---|
bin | 1001011011010001101010… |
… | …0010001001101001110101 |
3 | 1100200210211000010110102112 |
4 | 2112310122202021221311 |
5 | 2324301341004322201 |
6 | 34013125345420405 |
7 | 2116534366013141 |
oct | 226643242115165 |
9 | 40623730113375 |
10 | 10364201245301 |
11 | 3336484455132 |
12 | 11b479a03a705 |
13 | 5a2455c37a77 |
14 | 27b8b6aa2221 |
15 | 12e8e3acd0bb |
hex | 96d1a889a75 |
10364201245301 has 2 divisors, whose sum is σ = 10364201245302. Its totient is φ = 10364201245300.
The previous prime is 10364201245289. The next prime is 10364201245303. The reversal of 10364201245301 is 10354210246301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6684287989201 + 3679913256100 = 2585399^2 + 1918310^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10364201245301 is a prime.
It is a super-3 number, since 3×103642012453013 (a number of 40 digits) contains 333 as substring.
Together with 10364201245303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10364201245303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5182100622650 + 5182100622651.
It is an arithmetic number, because the mean of its divisors is an integer number (5182100622651).
Almost surely, 210364201245301 is an apocalyptic number.
It is an amenable number.
10364201245301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10364201245301 is an equidigital number, since it uses as much as digits as its factorization.
10364201245301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 32.
The spelling of 10364201245301 in words is "ten trillion, three hundred sixty-four billion, two hundred one million, two hundred forty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •