Base | Representation |
---|---|
bin | 1100001110001… |
… | …01010101011001 |
3 | 21010220120012201 |
4 | 12013011111121 |
5 | 202221121103 |
6 | 14101210201 |
7 | 2353256401 |
oct | 607052531 |
9 | 233816181 |
10 | 102520153 |
11 | 529629aa |
12 | 2a400961 |
13 | 18316918 |
14 | d889801 |
15 | 900151d |
hex | 61c5559 |
102520153 has 2 divisors, whose sum is σ = 102520154. Its totient is φ = 102520152.
The previous prime is 102520139. The next prime is 102520163. The reversal of 102520153 is 351025201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102353689 + 166464 = 10117^2 + 408^2 .
It is a cyclic number.
It is not a de Polignac number, because 102520153 - 213 = 102511961 is a prime.
It is a super-2 number, since 2×1025201532 = 21020763542286818, 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 102520153.
It is not a weakly prime, because it can be changed into another prime (102520163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51260076 + 51260077.
It is an arithmetic number, because the mean of its divisors is an integer number (51260077).
Almost surely, 2102520153 is an apocalyptic number.
It is an amenable number.
102520153 is a deficient number, since it is larger than the sum of its proper divisors (1).
102520153 is an equidigital number, since it uses as much as digits as its factorization.
102520153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 102520153 is about 10125.2236024692. The cubic root of 102520153 is about 468.0257507077.
Adding to 102520153 its reverse (351025201), we get a palindrome (453545354).
The spelling of 102520153 in words is "one hundred two million, five hundred twenty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •