Base | Representation |
---|---|
bin | 101110001011110100001101… |
… | …001110011100111010111101 |
3 | 222122012021200002211022220211 |
4 | 232023310031032130322331 |
5 | 203110423040204101023 |
6 | 2000001001554512421 |
7 | 60533042150324023 |
oct | 5613641516347275 |
9 | 878167602738824 |
10 | 203122110222013 |
11 | 597a266a924184 |
12 | 1a946513895711 |
13 | 8945443232908 |
14 | 382323c210713 |
15 | 1873a13b6ea0d |
hex | b8bd0d39cebd |
203122110222013 has 16 divisors (see below), whose sum is σ = 208680338958336. Its totient is φ = 197592668904960.
The previous prime is 203122110221971. The next prime is 203122110222079. The reversal of 203122110222013 is 310222011221302.
It is a cyclic number.
It is not a de Polignac number, because 203122110222013 - 229 = 203121573351101 is a prime.
It is a super-2 number, since 2×2031221102220132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203122110922013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 843014245 + ... + 843255157.
It is an arithmetic number, because the mean of its divisors is an integer number (13042521184896).
Almost surely, 2203122110222013 is an apocalyptic number.
It is an amenable number.
203122110222013 is a deficient number, since it is larger than the sum of its proper divisors (5558228736323).
203122110222013 is a wasteful number, since it uses less digits than its factorization.
203122110222013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 300564.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 203122110222013 its reverse (310222011221302), we get a palindrome (513344121443315).
The spelling of 203122110222013 in words is "two hundred three trillion, one hundred twenty-two billion, one hundred ten million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •