Base | Representation |
---|---|
bin | 1001010001111110000001… |
… | …0011110010010101100101 |
3 | 1100010112002221200200101012 |
4 | 2110133200103302111211 |
5 | 2314141412004030201 |
6 | 33411443502312005 |
7 | 2102144221031222 |
oct | 224374023622545 |
9 | 40115087620335 |
10 | 10204310611301 |
11 | 32846953502a4 |
12 | 11897b6b88605 |
13 | 590354540a71 |
14 | 273c698da949 |
15 | 12a686a455bb |
hex | 947e04f2565 |
10204310611301 has 2 divisors, whose sum is σ = 10204310611302. Its totient is φ = 10204310611300.
The previous prime is 10204310611267. The next prime is 10204310611309. The reversal of 10204310611301 is 10311601340201.
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., 9243734203201 + 960576408100 = 3040351^2 + 980090^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10204310611301 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10204310611309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5102155305650 + 5102155305651.
It is an arithmetic number, because the mean of its divisors is an integer number (5102155305651).
Almost surely, 210204310611301 is an apocalyptic number.
It is an amenable number.
10204310611301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10204310611301 is an equidigital number, since it uses as much as digits as its factorization.
10204310611301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 10204310611301 its reverse (10311601340201), we get a palindrome (20515911951502).
The spelling of 10204310611301 in words is "ten trillion, two hundred four billion, three hundred ten million, six hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •