Base | Representation |
---|---|
bin | 1111100001010… |
… | …11111101111101 |
3 | 100002000000122111 |
4 | 13300223331331 |
5 | 231313003032 |
6 | 20530414021 |
7 | 3140466043 |
oct | 760537575 |
9 | 302000574 |
10 | 130203517 |
11 | 67550914 |
12 | 37731311 |
13 | 20c8a302 |
14 | 13414393 |
15 | b66dc47 |
hex | 7c2bf7d |
130203517 has 2 divisors, whose sum is σ = 130203518. Its totient is φ = 130203516.
The previous prime is 130203509. The next prime is 130203539. The reversal of 130203517 is 715302031.
It is an a-pointer prime, because the next prime (130203539) can be obtained adding 130203517 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108868356 + 21335161 = 10434^2 + 4619^2 .
It is a cyclic number.
It is not a de Polignac number, because 130203517 - 23 = 130203509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130203587) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65101758 + 65101759.
It is an arithmetic number, because the mean of its divisors is an integer number (65101759).
Almost surely, 2130203517 is an apocalyptic number.
It is an amenable number.
130203517 is a deficient number, since it is larger than the sum of its proper divisors (1).
130203517 is an equidigital number, since it uses as much as digits as its factorization.
130203517 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 22.
The square root of 130203517 is about 11410.6755715865. The cubic root of 130203517 is about 506.8439168528.
Adding to 130203517 its reverse (715302031), we get a palindrome (845505548).
The spelling of 130203517 in words is "one hundred thirty million, two hundred three thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •