Base | Representation |
---|---|
bin | 111100001101101… |
… | …010010110011101 |
3 | 2121101220012111111 |
4 | 330031222112131 |
5 | 4032103324201 |
6 | 244124222021 |
7 | 34014452125 |
oct | 7415522635 |
9 | 2541805444 |
10 | 1010214301 |
11 | 47926aa58 |
12 | 24239a911 |
13 | 1313a5455 |
14 | 98249c85 |
15 | 5da4cb51 |
hex | 3c36a59d |
1010214301 has 2 divisors, whose sum is σ = 1010214302. Its totient is φ = 1010214300.
The previous prime is 1010214281. The next prime is 1010214319. The reversal of 1010214301 is 1034120101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 800833401 + 209380900 = 28299^2 + 14470^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010214301 - 211 = 1010212253 is a prime.
It is a super-3 number, since 3×10102143013 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010214371) 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, 505107150 + 505107151.
It is an arithmetic number, because the mean of its divisors is an integer number (505107151).
Almost surely, 21010214301 is an apocalyptic number.
It is an amenable number.
1010214301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010214301 is an equidigital number, since it uses as much as digits as its factorization.
1010214301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1010214301 is about 31783.8685656734. The cubic root of 1010214301 is about 1003.3932398996.
Adding to 1010214301 its reverse (1034120101), we get a palindrome (2044334402).
The spelling of 1010214301 in words is "one billion, ten million, two hundred fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •