Base | Representation |
---|---|
bin | 101110001100000111110111… |
… | …110101100000111111110011 |
3 | 222122021022011201021011020111 |
4 | 232030013313311200333303 |
5 | 203111244311401400201 |
6 | 2000014413151322151 |
7 | 60534420343222144 |
oct | 5614076765407763 |
9 | 878238151234214 |
10 | 203143226200051 |
11 | 59800616290aa5 |
12 | 1a94a627520357 |
13 | 8947429b93a87 |
14 | 38242827d3acb |
15 | 187434c87ab51 |
hex | b8c1f7d60ff3 |
203143226200051 has 2 divisors, whose sum is σ = 203143226200052. Its totient is φ = 203143226200050.
The previous prime is 203143226199913. The next prime is 203143226200127. The reversal of 203143226200051 is 150002622341302.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 203143226200051 - 213 = 203143226191859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 203143226199986 and 203143226200022.
It is not a weakly prime, because it can be changed into another prime (203143226200151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101571613100025 + 101571613100026.
It is an arithmetic number, because the mean of its divisors is an integer number (101571613100026).
Almost surely, 2203143226200051 is an apocalyptic number.
203143226200051 is a deficient number, since it is larger than the sum of its proper divisors (1).
203143226200051 is an equidigital number, since it uses as much as digits as its factorization.
203143226200051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 203143226200051 its reverse (150002622341302), we get a palindrome (353145848541353).
The spelling of 203143226200051 in words is "two hundred three trillion, one hundred forty-three billion, two hundred twenty-six million, two hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •