Base | Representation |
---|---|
bin | 111100110011100… |
… | …000011110000101 |
3 | 2122002120020112221 |
4 | 330303200132011 |
5 | 4042123312201 |
6 | 245121012341 |
7 | 34165002253 |
oct | 7463403605 |
9 | 2562506487 |
10 | 1020135301 |
11 | 483926829 |
12 | 2457840b1 |
13 | 13346a073 |
14 | 996ad5d3 |
15 | 5e85c4a1 |
hex | 3cce0785 |
1020135301 has 2 divisors, whose sum is σ = 1020135302. Its totient is φ = 1020135300.
The previous prime is 1020135299. The next prime is 1020135331. The reversal of 1020135301 is 1035310201.
1020135301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 514110276 + 506025025 = 22674^2 + 22495^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020135301 - 21 = 1020135299 is a prime.
Together with 1020135299, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020135331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510067650 + 510067651.
It is an arithmetic number, because the mean of its divisors is an integer number (510067651).
Almost surely, 21020135301 is an apocalyptic number.
It is an amenable number.
1020135301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020135301 is an equidigital number, since it uses as much as digits as its factorization.
1020135301 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 1020135301 is about 31939.5569944231. The cubic root of 1020135301 is about 1006.6672164351.
Adding to 1020135301 its reverse (1035310201), we get a palindrome (2055445502).
The spelling of 1020135301 in words is "one billion, twenty million, one hundred thirty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •