Base | Representation |
---|---|
bin | 11110000000110000111… |
… | …00100110000110011001 |
3 | 10122120201021001111211101 |
4 | 33000120130212012121 |
5 | 113343400242102223 |
6 | 2105421112031401 |
7 | 134334103633423 |
oct | 17003034460631 |
9 | 3576637044741 |
10 | 1031202300313 |
11 | 36836a8a6a49 |
12 | 147a2b692561 |
13 | 7631b77c133 |
14 | 37ca641d813 |
15 | 1bc55bd24ad |
hex | f018726199 |
1031202300313 has 2 divisors, whose sum is σ = 1031202300314. Its totient is φ = 1031202300312.
The previous prime is 1031202300287. The next prime is 1031202300371. The reversal of 1031202300313 is 3130032021301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 853613383744 + 177588916569 = 923912^2 + 421413^2 .
It is an emirp because it is prime and its reverse (3130032021301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1031202300313 - 25 = 1031202300281 is a prime.
It is not a weakly prime, because it can be changed into another prime (1031202000313) 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, 515601150156 + 515601150157.
It is an arithmetic number, because the mean of its divisors is an integer number (515601150157).
Almost surely, 21031202300313 is an apocalyptic number.
It is an amenable number.
1031202300313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031202300313 is an equidigital number, since it uses as much as digits as its factorization.
1031202300313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1031202300313 its reverse (3130032021301), we get a palindrome (4161234321614).
The spelling of 1031202300313 in words is "one trillion, thirty-one billion, two hundred two million, three hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •