Base | Representation |
---|---|
bin | 10010111101100001100… |
… | …100110100000111100101 |
3 | 11121120022011012120120201 |
4 | 102331201210310013211 |
5 | 132322032101200201 |
6 | 2434332344030501 |
7 | 163065566241316 |
oct | 22754144640745 |
9 | 4546264176521 |
10 | 1303012131301 |
11 | 462671419001 |
12 | 190648162431 |
13 | 95b4816865a |
14 | 470cd62c60d |
15 | 23d635b3801 |
hex | 12f619341e5 |
1303012131301 has 2 divisors, whose sum is σ = 1303012131302. Its totient is φ = 1303012131300.
The previous prime is 1303012131299. The next prime is 1303012131341. The reversal of 1303012131301 is 1031312103031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 773122767076 + 529889364225 = 879274^2 + 727935^2 .
It is a cyclic number.
It is not a de Polignac number, because 1303012131301 - 21 = 1303012131299 is a prime.
It is a super-2 number, since 2×13030121313012 (a number of 25 digits) contains 22 as substring.
Together with 1303012131299, 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 (1303012131341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651506065650 + 651506065651.
It is an arithmetic number, because the mean of its divisors is an integer number (651506065651).
Almost surely, 21303012131301 is an apocalyptic number.
It is an amenable number.
1303012131301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1303012131301 is an equidigital number, since it uses as much as digits as its factorization.
1303012131301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1303012131301 its reverse (1031312103031), we get a palindrome (2334324234332).
The spelling of 1303012131301 in words is "one trillion, three hundred three billion, twelve million, one hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •