Base | Representation |
---|---|
bin | 10011001100000001… |
… | …10000111110000001 |
3 | 222120220220220120012 |
4 | 21212000300332001 |
5 | 132044130124301 |
6 | 4422110554305 |
7 | 513164356544 |
oct | 114600607601 |
9 | 28526826505 |
10 | 10301411201 |
11 | 4406972784 |
12 | 1bb5b08995 |
13 | c822906b3 |
14 | 6da1c285b |
15 | 404599ebb |
hex | 266030f81 |
10301411201 has 2 divisors, whose sum is σ = 10301411202. Its totient is φ = 10301411200.
The previous prime is 10301411191. The next prime is 10301411207. The reversal of 10301411201 is 10211410301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9766182976 + 535228225 = 98824^2 + 23135^2 .
It is an emirp because it is prime and its reverse (10211410301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10301411201 - 218 = 10301149057 is a prime.
It is a super-2 number, since 2×103014112012 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10301411207) 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, 5150705600 + 5150705601.
It is an arithmetic number, because the mean of its divisors is an integer number (5150705601).
Almost surely, 210301411201 is an apocalyptic number.
It is an amenable number.
10301411201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10301411201 is an equidigital number, since it uses as much as digits as its factorization.
10301411201 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 14.
Adding to 10301411201 its reverse (10211410301), we get a palindrome (20512821502).
The spelling of 10301411201 in words is "ten billion, three hundred one million, four hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •