Base | Representation |
---|---|
bin | 10010111101100010101… |
… | …101100110110000111101 |
3 | 11121120100111010000220122 |
4 | 102331202231212300331 |
5 | 132322101442304432 |
6 | 2434334305024325 |
7 | 163066220364404 |
oct | 22754255466075 |
9 | 4546314100818 |
10 | 1303031213117 |
11 | 4626811714a7 |
12 | 1906526250a5 |
13 | 95b4c0b9b7a |
14 | 470d1d9863b |
15 | 23d650d2612 |
hex | 12f62b66c3d |
1303031213117 has 2 divisors, whose sum is σ = 1303031213118. Its totient is φ = 1303031213116.
The previous prime is 1303031213093. The next prime is 1303031213129. The reversal of 1303031213117 is 7113121303031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1270532498041 + 32498715076 = 1127179^2 + 180274^2 .
It is a cyclic number.
It is not a de Polignac number, because 1303031213117 - 26 = 1303031213053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1303031213417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651515606558 + 651515606559.
It is an arithmetic number, because the mean of its divisors is an integer number (651515606559).
Almost surely, 21303031213117 is an apocalyptic number.
It is an amenable number.
1303031213117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1303031213117 is an equidigital number, since it uses as much as digits as its factorization.
1303031213117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 26.
Adding to 1303031213117 its reverse (7113121303031), we get a palindrome (8416152516148).
The spelling of 1303031213117 in words is "one trillion, three hundred three billion, thirty-one million, two hundred thirteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •