Base | Representation |
---|---|
bin | 1100001110001… |
… | …11101110111101 |
3 | 21010221001200201 |
4 | 12013013232331 |
5 | 202221424411 |
6 | 14101323501 |
7 | 2353330141 |
oct | 607075675 |
9 | 233831621 |
10 | 102529981 |
11 | 5296a324 |
12 | 2a406591 |
13 | 1831b238 |
14 | d88d221 |
15 | 90043c1 |
hex | 61c7bbd |
102529981 has 2 divisors, whose sum is σ = 102529982. Its totient is φ = 102529980.
The previous prime is 102529969. The next prime is 102529991. The reversal of 102529981 is 189925201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55264356 + 47265625 = 7434^2 + 6875^2 .
It is a cyclic number.
It is not a de Polignac number, because 102529981 - 213 = 102521789 is a prime.
It is a super-2 number, since 2×1025299812 = 21024794007720722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102529981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102529951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51264990 + 51264991.
It is an arithmetic number, because the mean of its divisors is an integer number (51264991).
Almost surely, 2102529981 is an apocalyptic number.
It is an amenable number.
102529981 is a deficient number, since it is larger than the sum of its proper divisors (1).
102529981 is an equidigital number, since it uses as much as digits as its factorization.
102529981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 37.
The square root of 102529981 is about 10125.7089134539. The cubic root of 102529981 is about 468.0407058489.
The spelling of 102529981 in words is "one hundred two million, five hundred twenty-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •