Base | Representation |
---|---|
bin | 101110001011110100001111… |
… | …000100010000100011010101 |
3 | 222122012021202020221022111202 |
4 | 232023310033010100203111 |
5 | 203110423121110314331 |
6 | 2000001005020442245 |
7 | 60533043003655664 |
oct | 5613641704204325 |
9 | 878167666838452 |
10 | 203122141104341 |
11 | 597a26862a7568 |
12 | 1a9465220a9385 |
13 | 8945449756394 |
14 | 382324236cddb |
15 | 1873a1671eecb |
hex | b8bd0f1108d5 |
203122141104341 has 2 divisors, whose sum is σ = 203122141104342. Its totient is φ = 203122141104340.
The previous prime is 203122141104331. The next prime is 203122141104353. The reversal of 203122141104341 is 143401141221302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 146284428936100 + 56837712168241 = 12094810^2 + 7539079^2 .
It is a cyclic number.
It is not a de Polignac number, because 203122141104341 - 242 = 198724094593237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203122141104331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101561070552170 + 101561070552171.
It is an arithmetic number, because the mean of its divisors is an integer number (101561070552171).
Almost surely, 2203122141104341 is an apocalyptic number.
It is an amenable number.
203122141104341 is a deficient number, since it is larger than the sum of its proper divisors (1).
203122141104341 is an equidigital number, since it uses as much as digits as its factorization.
203122141104341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 203122141104341 its reverse (143401141221302), we get a palindrome (346523282325643).
The spelling of 203122141104341 in words is "two hundred three trillion, one hundred twenty-two billion, one hundred forty-one million, one hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •