Base | Representation |
---|---|
bin | 1001010001111101110000… |
… | …1000110000110010110001 |
3 | 1100010111221001222101010002 |
4 | 2110133130020300302301 |
5 | 2314141241044100104 |
6 | 33411432522115345 |
7 | 2102142411041165 |
oct | 224373410606261 |
9 | 40114831871102 |
10 | 10204240612529 |
11 | 3284659890177 |
12 | 118979764bb55 |
13 | 590342ba2982 |
14 | 273c604b8ca5 |
15 | 12a68081a01e |
hex | 947dc230cb1 |
10204240612529 has 2 divisors, whose sum is σ = 10204240612530. Its totient is φ = 10204240612528.
The previous prime is 10204240612513. The next prime is 10204240612537. The reversal of 10204240612529 is 92521604240201.
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., 9982926818929 + 221313793600 = 3159577^2 + 470440^2 .
It is a cyclic number.
It is not a de Polignac number, because 10204240612529 - 24 = 10204240612513 is a prime.
It is a super-2 number, since 2×102042406125292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10204240612492 and 10204240612501.
It is not a weakly prime, because it can be changed into another prime (10204240612829) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5102120306264 + 5102120306265.
It is an arithmetic number, because the mean of its divisors is an integer number (5102120306265).
Almost surely, 210204240612529 is an apocalyptic number.
It is an amenable number.
10204240612529 is a deficient number, since it is larger than the sum of its proper divisors (1).
10204240612529 is an equidigital number, since it uses as much as digits as its factorization.
10204240612529 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 69120, while the sum is 38.
The spelling of 10204240612529 in words is "ten trillion, two hundred four billion, two hundred forty million, six hundred twelve thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •