Base | Representation |
---|---|
bin | 100110110100011… |
… | …0000100000110101 |
3 | 10100202221101101121 |
4 | 1031220300200311 |
5 | 10131421430401 |
6 | 333125423541 |
7 | 44164215565 |
oct | 11550604065 |
9 | 3322841347 |
10 | 1302530101 |
11 | 609276164 |
12 | 30426abb1 |
13 | 179b12792 |
14 | c4dbcda5 |
15 | 7953eca1 |
hex | 4da30835 |
1302530101 has 2 divisors, whose sum is σ = 1302530102. Its totient is φ = 1302530100.
The previous prime is 1302530093. The next prime is 1302530143. The reversal of 1302530101 is 1010352031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1142507601 + 160022500 = 33801^2 + 12650^2 .
It is a cyclic number.
It is not a de Polignac number, because 1302530101 - 23 = 1302530093 is a prime.
It is a super-2 number, since 2×13025301012 = 3393169328022140402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1302530171) 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, 651265050 + 651265051.
It is an arithmetic number, because the mean of its divisors is an integer number (651265051).
Almost surely, 21302530101 is an apocalyptic number.
It is an amenable number.
1302530101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1302530101 is an equidigital number, since it uses as much as digits as its factorization.
1302530101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 1302530101 is about 36090.5818878000. The cubic root of 1302530101 is about 1092.1004586408.
Adding to 1302530101 its reverse (1010352031), we get a palindrome (2312882132).
The spelling of 1302530101 in words is "one billion, three hundred two million, five hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •