Base | Representation |
---|---|
bin | 1001010100101111110101… |
… | …0001111011011111111101 |
3 | 1100022002022101102002200202 |
4 | 2111023331101323133331 |
5 | 2320432140033212221 |
6 | 33445420040533245 |
7 | 2105454066154664 |
oct | 225137521733775 |
9 | 40262271362622 |
10 | 10252041304061 |
11 | 32a2959056217 |
12 | 1196ab7a81225 |
13 | 5949c00c3a2b |
14 | 2762b6aabddb |
15 | 12ba2c07cd0b |
hex | 952fd47b7fd |
10252041304061 has 2 divisors, whose sum is σ = 10252041304062. Its totient is φ = 10252041304060.
The previous prime is 10252041303991. The next prime is 10252041304067. The reversal of 10252041304061 is 16040314025201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7626053463961 + 2625987840100 = 2761531^2 + 1620490^2 .
It is a cyclic number.
It is not a de Polignac number, because 10252041304061 - 234 = 10234861434877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10252041304067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5126020652030 + 5126020652031.
It is an arithmetic number, because the mean of its divisors is an integer number (5126020652031).
Almost surely, 210252041304061 is an apocalyptic number.
It is an amenable number.
10252041304061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10252041304061 is an equidigital number, since it uses as much as digits as its factorization.
10252041304061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 10252041304061 its reverse (16040314025201), we get a palindrome (26292355329262).
The spelling of 10252041304061 in words is "ten trillion, two hundred fifty-two billion, forty-one million, three hundred four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •