Base | Representation |
---|---|
bin | 10010111101101110101… |
… | …000000111110000110001 |
3 | 11121120212102020102220122 |
4 | 102331232220013300301 |
5 | 132323004130231001 |
6 | 2434410205220025 |
7 | 163104165410003 |
oct | 22755650076061 |
9 | 4546772212818 |
10 | 1303231102001 |
11 | 462773a88a24 |
12 | 1906a9561615 |
13 | 95b8163570a |
14 | 4711074c373 |
15 | 23d77918b1b |
hex | 12f6ea07c31 |
1303231102001 has 2 divisors, whose sum is σ = 1303231102002. Its totient is φ = 1303231102000.
The previous prime is 1303231101983. The next prime is 1303231102007. The reversal of 1303231102001 is 1002011323031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1174763338225 + 128467763776 = 1083865^2 + 358424^2 .
It is a cyclic number.
It is not a de Polignac number, because 1303231102001 - 218 = 1303230839857 is a prime.
It is a super-2 number, since 2×13032311020012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1303231102007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651615551000 + 651615551001.
It is an arithmetic number, because the mean of its divisors is an integer number (651615551001).
Almost surely, 21303231102001 is an apocalyptic number.
It is an amenable number.
1303231102001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1303231102001 is an equidigital number, since it uses as much as digits as its factorization.
1303231102001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1303231102001 its reverse (1002011323031), we get a palindrome (2305242425032).
The spelling of 1303231102001 in words is "one trillion, three hundred three billion, two hundred thirty-one million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •