Base | Representation |
---|---|
bin | 101110001011100010011011… |
… | …100010111100011100100101 |
3 | 222122010110101220002012022121 |
4 | 232023202123202330130211 |
5 | 203110114442404402323 |
6 | 1555544124000025541 |
7 | 60531465151544524 |
oct | 5613423342743445 |
9 | 878113356065277 |
10 | 203103023122213 |
11 | 59795565738635 |
12 | 1a9428876022b1 |
13 | 89436c0a1a316 |
14 | 382234b2824bb |
15 | 187329812ca5d |
hex | b8b89b8bc725 |
203103023122213 has 8 divisors (see below), whose sum is σ = 203360834476800. Its totient is φ = 202845334046880.
The previous prime is 203103023122151. The next prime is 203103023122229. The reversal of 203103023122213 is 312221320301302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 203103023122213 - 213 = 203103023114021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203103023122243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27245523 + ... + 33889888.
It is an arithmetic number, because the mean of its divisors is an integer number (25420104309600).
Almost surely, 2203103023122213 is an apocalyptic number.
It is an amenable number.
203103023122213 is a deficient number, since it is larger than the sum of its proper divisors (257811354587).
203103023122213 is a wasteful number, since it uses less digits than its factorization.
203103023122213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61139627.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 203103023122213 its reverse (312221320301302), we get a palindrome (515324343423515).
The spelling of 203103023122213 in words is "two hundred three trillion, one hundred three billion, twenty-three million, one hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •