Base | Representation |
---|---|
bin | 10010111101101000001… |
… | …100001000010101001001 |
3 | 11121120120220000102101121 |
4 | 102331220030020111021 |
5 | 132322244003213001 |
6 | 2434351350315241 |
7 | 163101414412201 |
oct | 22755014102511 |
9 | 4546526012347 |
10 | 1303123101001 |
11 | 4627190221a7 |
12 | 190679358b21 |
13 | 95b651501b7 |
14 | 47100277401 |
15 | 23d6d1d36a1 |
hex | 12f68308549 |
1303123101001 has 2 divisors, whose sum is σ = 1303123101002. Its totient is φ = 1303123101000.
The previous prime is 1303123100999. The next prime is 1303123101019. The reversal of 1303123101001 is 1001013213031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 769129000000 + 533994101001 = 877000^2 + 730749^2 .
It is a cyclic number.
It is not a de Polignac number, because 1303123101001 - 21 = 1303123100999 is a prime.
Together with 1303123100999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1303123104001) 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, 651561550500 + 651561550501.
It is an arithmetic number, because the mean of its divisors is an integer number (651561550501).
Almost surely, 21303123101001 is an apocalyptic number.
It is an amenable number.
1303123101001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1303123101001 is an equidigital number, since it uses as much as digits as its factorization.
1303123101001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1303123101001 its reverse (1001013213031), we get a palindrome (2304136314032).
The spelling of 1303123101001 in words is "one trillion, three hundred three billion, one hundred twenty-three million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •