Base | Representation |
---|---|
bin | 101110001100111111110100… |
… | …101000100011100100010001 |
3 | 222122111001020111111200002011 |
4 | 232030333310220203210101 |
5 | 203113240330303410301 |
6 | 2000102150324422521 |
7 | 60541645153214350 |
oct | 5614776450434421 |
9 | 878431214450064 |
10 | 203203302013201 |
11 | 5982404453a656 |
12 | 1a95a1b2847a41 |
13 | 894ccb22466c9 |
14 | 382714137d997 |
15 | 1875bb6aa6a51 |
hex | b8cff4a23911 |
203203302013201 has 16 divisors (see below), whose sum is σ = 242332795254528. Its totient is φ = 166599133272000.
The previous prime is 203203302013181. The next prime is 203203302013213. The reversal of 203203302013201 is 102310203302302.
203203302013201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 203203302013201 - 221 = 203203299916049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203203302013501) 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, 2753851 + ... + 20346751.
It is an arithmetic number, because the mean of its divisors is an integer number (15145799703408).
Almost surely, 2203203302013201 is an apocalyptic number.
It is an amenable number.
203203302013201 is a deficient number, since it is larger than the sum of its proper divisors (39129493241327).
203203302013201 is a wasteful number, since it uses less digits than its factorization.
203203302013201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17664672.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 203203302013201 its reverse (102310203302302), we get a palindrome (305513505315503).
The spelling of 203203302013201 in words is "two hundred three trillion, two hundred three billion, three hundred two million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •