Base | Representation |
---|---|
bin | 11101111110101101110… |
… | …00011101110100111001 |
3 | 10122110212121020020001212 |
4 | 32333112320131310321 |
5 | 113334122142411301 |
6 | 2105120015252505 |
7 | 134264616111236 |
oct | 16772670356471 |
9 | 3573777206055 |
10 | 1030102310201 |
11 | 367955999108 |
12 | 14778321a135 |
13 | 761a4902b03 |
14 | 37c002c478d |
15 | 1bbde34e4bb |
hex | efd6e1dd39 |
1030102310201 has 2 divisors, whose sum is σ = 1030102310202. Its totient is φ = 1030102310200.
The previous prime is 1030102310191. The next prime is 1030102310203. The reversal of 1030102310201 is 1020132010301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 972543102976 + 57559207225 = 986176^2 + 239915^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1030102310201 is a prime.
It is a super-2 number, since 2×10301023102012 (a number of 25 digits) contains 22 as substring.
Together with 1030102310203, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1030102310203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515051155100 + 515051155101.
It is an arithmetic number, because the mean of its divisors is an integer number (515051155101).
Almost surely, 21030102310201 is an apocalyptic number.
It is an amenable number.
1030102310201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030102310201 is an equidigital number, since it uses as much as digits as its factorization.
1030102310201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1030102310201 its reverse (1020132010301), we get a palindrome (2050234320502).
The spelling of 1030102310201 in words is "one trillion, thirty billion, one hundred two million, three hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •