Base | Representation |
---|---|
bin | 101110001100111101000001… |
… | …110101101011010010001101 |
3 | 222122110202111110002000201011 |
4 | 232030331001311223102031 |
5 | 203113213204344043041 |
6 | 2000100532531045221 |
7 | 60541510630304302 |
oct | 5614750165532215 |
9 | 878422443060634 |
10 | 203200302331021 |
11 | 59822845276a76 |
12 | 1a9596b6140811 |
13 | 894c924943a38 |
14 | 3826d38c1b0a9 |
15 | 1875a8d576e81 |
hex | b8cf41d6b48d |
203200302331021 has 16 divisors (see below), whose sum is σ = 211168257984000. Its totient is φ = 195320732817600.
The previous prime is 203200302331009. The next prime is 203200302331027. The reversal of 203200302331021 is 120133203002302.
It is a cyclic number.
It is not a de Polignac number, because 203200302331021 - 223 = 203200293942413 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203200302330983 and 203200302331001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203200302331027) 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, 188559951 + ... + 189634531.
It is an arithmetic number, because the mean of its divisors is an integer number (13198016124000).
Almost surely, 2203200302331021 is an apocalyptic number.
It is an amenable number.
203200302331021 is a deficient number, since it is larger than the sum of its proper divisors (7967955652979).
203200302331021 is a wasteful number, since it uses less digits than its factorization.
203200302331021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1115700.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 203200302331021 its reverse (120133203002302), we get a palindrome (323333505333323).
The spelling of 203200302331021 in words is "two hundred three trillion, two hundred billion, three hundred two million, three hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •