Base | Representation |
---|---|
bin | 101110001110101110100000… |
… | …000000001001110111011001 |
3 | 222122220101222121102220002102 |
4 | 232032232200000021313121 |
5 | 203122212221123022223 |
6 | 2000232522513213145 |
7 | 60553353125625053 |
oct | 5616564000116731 |
9 | 878811877386072 |
10 | 203322141220313 |
11 | 5986a488137905 |
12 | 1a9792398611b5 |
13 | 895b270ab627b |
14 | 382cbb64808d3 |
15 | 1878d1ebb8928 |
hex | b8eba0009dd9 |
203322141220313 has 16 divisors (see below), whose sum is σ = 205347407865600. Its totient is φ = 201297868485120.
The previous prime is 203322141220267. The next prime is 203322141220321. The reversal of 203322141220313 is 313022141223302.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-203322141220313 is a prime.
It is a super-2 number, since 2×2033221412203132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203322141250313) 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, 10885056308 + ... + 10885074986.
It is an arithmetic number, because the mean of its divisors is an integer number (12834212991600).
Almost surely, 2203322141220313 is an apocalyptic number.
It is an amenable number.
203322141220313 is a deficient number, since it is larger than the sum of its proper divisors (2025266645287).
203322141220313 is a wasteful number, since it uses less digits than its factorization.
203322141220313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39512.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 203322141220313 its reverse (313022141223302), we get a palindrome (516344282443615).
The spelling of 203322141220313 in words is "two hundred three trillion, three hundred twenty-two billion, one hundred forty-one million, two hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •