Base | Representation |
---|---|
bin | 101110001010001100101111… |
… | …110110111011110101111001 |
3 | 222121210122221011221112120112 |
4 | 232022030233312323311321 |
5 | 203102113033130010243 |
6 | 1555433550455034105 |
7 | 60522030244052402 |
oct | 5612145766736571 |
9 | 877718834845515 |
10 | 203011022110073 |
11 | 5975a544549501 |
12 | 1a928a9066b935 |
13 | 8937b1b4880b8 |
14 | 381bb007049a9 |
15 | 1870bb128d818 |
hex | b8a32fdbbd79 |
203011022110073 has 2 divisors, whose sum is σ = 203011022110074. Its totient is φ = 203011022110072.
The previous prime is 203011022110067. The next prime is 203011022110151. The reversal of 203011022110073 is 370011220110302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 178308163891264 + 24702858218809 = 13353208^2 + 4970197^2 .
It is a cyclic number.
It is not a de Polignac number, because 203011022110073 - 26 = 203011022110009 is a prime.
It is a super-2 number, since 2×2030110221100732 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (203011022110063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101505511055036 + 101505511055037.
It is an arithmetic number, because the mean of its divisors is an integer number (101505511055037).
Almost surely, 2203011022110073 is an apocalyptic number.
It is an amenable number.
203011022110073 is a deficient number, since it is larger than the sum of its proper divisors (1).
203011022110073 is an equidigital number, since it uses as much as digits as its factorization.
203011022110073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 203011022110073 its reverse (370011220110302), we get a palindrome (573022242220375).
The spelling of 203011022110073 in words is "two hundred three trillion, eleven billion, twenty-two million, one hundred ten thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •