Base | Representation |
---|---|
bin | 101110001011110100011001… |
… | …111111001010111101110001 |
3 | 222122012022020000200122022002 |
4 | 232023310121333022331301 |
5 | 203110424010011220423 |
6 | 2000001035123423345 |
7 | 60533050360166522 |
oct | 5613643177127561 |
9 | 878168200618262 |
10 | 203122324320113 |
11 | 597a276a766260 |
12 | 1a946573524b55 |
13 | 89454786b4b93 |
14 | 382325c822849 |
15 | 1873a27861228 |
hex | b8bd19fcaf71 |
203122324320113 has 16 divisors (see below), whose sum is σ = 238213292912640. Its totient is φ = 171215804264400.
The previous prime is 203122324320061. The next prime is 203122324320143. The reversal of 203122324320113 is 311023423221302.
It is a cyclic number.
It is not a de Polignac number, because 203122324320113 - 28 = 203122324319857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203122324320143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10339108793 + ... + 10339128438.
It is an arithmetic number, because the mean of its divisors is an integer number (14888330807040).
Almost surely, 2203122324320113 is an apocalyptic number.
It is an amenable number.
203122324320113 is a deficient number, since it is larger than the sum of its proper divisors (35090968592527).
203122324320113 is a wasteful number, since it uses less digits than its factorization.
203122324320113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20678237308.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 203122324320113 its reverse (311023423221302), we get a palindrome (514145747541415).
The spelling of 203122324320113 in words is "two hundred three trillion, one hundred twenty-two billion, three hundred twenty-four million, three hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •