Base | Representation |
---|---|
bin | 10111011101110100100010… |
… | …000110101001101000010111 |
3 | 111112102020102222211121121112 |
4 | 113131310202012221220113 |
5 | 102011344442334334221 |
6 | 1003255230410005235 |
7 | 30511160534041463 |
oct | 2735644206515027 |
9 | 445366388747545 |
10 | 103204341324311 |
11 | 2a97a796167287 |
12 | b6a983911681b |
13 | 4578187522a66 |
14 | 1b6b18c5cd4a3 |
15 | bde8ad68115b |
hex | 5ddd221a9a17 |
103204341324311 has 2 divisors, whose sum is σ = 103204341324312. Its totient is φ = 103204341324310.
The previous prime is 103204341324307. The next prime is 103204341324373. The reversal of 103204341324311 is 113423143402301.
It is a weak prime.
It is an emirp because it is prime and its reverse (113423143402301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103204341324311 - 22 = 103204341324307 is a prime.
It is a super-2 number, since 2×1032043413243112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103204341354311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51602170662155 + 51602170662156.
It is an arithmetic number, because the mean of its divisors is an integer number (51602170662156).
Almost surely, 2103204341324311 is an apocalyptic number.
103204341324311 is a deficient number, since it is larger than the sum of its proper divisors (1).
103204341324311 is an equidigital number, since it uses as much as digits as its factorization.
103204341324311 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 103204341324311 its reverse (113423143402301), we get a palindrome (216627484726612).
The spelling of 103204341324311 in words is "one hundred three trillion, two hundred four billion, three hundred forty-one million, three hundred twenty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •