Base | Representation |
---|---|
bin | 101110001100111101111000… |
… | …100110101000011100010111 |
3 | 222122110211212110222001120221 |
4 | 232030331320212220130113 |
5 | 203113222100102242403 |
6 | 2000101204032135211 |
7 | 60541542455065423 |
oct | 5614757046503427 |
9 | 878424773861527 |
10 | 203201221134103 |
11 | 59823176981365 |
12 | 1a959911997507 |
13 | 894ca400c1aba |
14 | 3826dc4c6db83 |
15 | 1875ae4069dbd |
hex | b8cf789a8717 |
203201221134103 has 16 divisors (see below), whose sum is σ = 205169473998720. Its totient is φ = 201234261997216.
The previous prime is 203201221134097. The next prime is 203201221134169. The reversal of 203201221134103 is 301431122102302.
It is a cyclic number.
It is not a de Polignac number, because 203201221134103 - 25 = 203201221134071 is a prime.
It is a super-2 number, since 2×2032012211341032 (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 (203201221132103) 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, 4312121700 + ... + 4312168822.
It is an arithmetic number, because the mean of its divisors is an integer number (12823092124920).
Almost surely, 2203201221134103 is an apocalyptic number.
203201221134103 is a deficient number, since it is larger than the sum of its proper divisors (1968252864617).
203201221134103 is a wasteful number, since it uses less digits than its factorization.
203201221134103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59966.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 203201221134103 its reverse (301431122102302), we get a palindrome (504632343236405).
The spelling of 203201221134103 in words is "two hundred three trillion, two hundred one billion, two hundred twenty-one million, one hundred thirty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •