Base | Representation |
---|---|
bin | 1001010011100001100010… |
… | …1100010000000110010001 |
3 | 1100020002001211001221200112 |
4 | 2110320120230100012101 |
5 | 2320111120221240104 |
6 | 33432022453331105 |
7 | 2104111241055503 |
oct | 224703054200621 |
9 | 40202054057615 |
10 | 10231026352529 |
11 | 3294a54721084 |
12 | 1192a12036a95 |
13 | 592a21375678 |
14 | 275281aa5d73 |
15 | 12b1ec17a86e |
hex | 94e18b10191 |
10231026352529 has 2 divisors, whose sum is σ = 10231026352530. Its totient is φ = 10231026352528.
The previous prime is 10231026352517. The next prime is 10231026352531. The reversal of 10231026352529 is 92525362013201.
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., 7989373596304 + 2241652756225 = 2826548^2 + 1497215^2 .
It is a cyclic number.
It is not a de Polignac number, because 10231026352529 - 240 = 9131514724753 is a prime.
It is a super-2 number, since 2×102310263525292 (a number of 27 digits) contains 22 as substring.
Together with 10231026352531, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10231026352549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5115513176264 + 5115513176265.
It is an arithmetic number, because the mean of its divisors is an integer number (5115513176265).
Almost surely, 210231026352529 is an apocalyptic number.
It is an amenable number.
10231026352529 is a deficient number, since it is larger than the sum of its proper divisors (1).
10231026352529 is an equidigital number, since it uses as much as digits as its factorization.
10231026352529 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 194400, while the sum is 41.
The spelling of 10231026352529 in words is "ten trillion, two hundred thirty-one billion, twenty-six million, three hundred fifty-two thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •