Base | Representation |
---|---|
bin | 101110001011111011110001… |
… | …010101110000110011011001 |
3 | 222122020001122010222012102111 |
4 | 232023323301111300303121 |
5 | 203111041203432423001 |
6 | 2000004423535232321 |
7 | 60533450343045532 |
oct | 5613736125606331 |
9 | 878201563865374 |
10 | 203130232311001 |
11 | 597a60585aa916 |
12 | 1a947bbb9786a1 |
13 | 8946138b51728 |
14 | 38237acbb9689 |
15 | 1873d3bc34851 |
hex | b8bef1570cd9 |
203130232311001 has 2 divisors, whose sum is σ = 203130232311002. Its totient is φ = 203130232311000.
The previous prime is 203130232310969. The next prime is 203130232311007. The reversal of 203130232311001 is 100113232031302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 201681040088025 + 1449192222976 = 14201445^2 + 1203824^2 .
It is a cyclic number.
It is not a de Polignac number, because 203130232311001 - 25 = 203130232310969 is a prime.
It is a super-2 number, since 2×2031302323110012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (203130232311007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101565116155500 + 101565116155501.
It is an arithmetic number, because the mean of its divisors is an integer number (101565116155501).
Almost surely, 2203130232311001 is an apocalyptic number.
It is an amenable number.
203130232311001 is a deficient number, since it is larger than the sum of its proper divisors (1).
203130232311001 is an equidigital number, since it uses as much as digits as its factorization.
203130232311001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 203130232311001 its reverse (100113232031302), we get a palindrome (303243464342303).
The spelling of 203130232311001 in words is "two hundred three trillion, one hundred thirty billion, two hundred thirty-two million, three hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •