Base | Representation |
---|---|
bin | 1011101101100001110… |
… | …1001000010001010001 |
3 | 201020022222022112012010 |
4 | 2323120131020101101 |
5 | 11244024200312241 |
6 | 232232514253133 |
7 | 20351631604242 |
oct | 2733035102121 |
9 | 636288275163 |
10 | 201200010321 |
11 | 78368184772 |
12 | 32bb15871a9 |
13 | 15c85b1825b |
14 | 9a49614cc9 |
15 | 53789b2d16 |
hex | 2ed8748451 |
201200010321 has 8 divisors (see below), whose sum is σ = 268280941824. Its totient is φ = 134126209520.
The previous prime is 201200010317. The next prime is 201200010331. The reversal of 201200010321 is 123010002102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201200010321 - 22 = 201200010317 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201200010297 and 201200010306.
It is not an unprimeable number, because it can be changed into a prime (201200010331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1716486 + ... + 1829951.
It is an arithmetic number, because the mean of its divisors is an integer number (33535117728).
Almost surely, 2201200010321 is an apocalyptic number.
It is an amenable number.
201200010321 is a deficient number, since it is larger than the sum of its proper divisors (67080931503).
201200010321 is a wasteful number, since it uses less digits than its factorization.
201200010321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3565351.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 201200010321 its reverse (123010002102), we get a palindrome (324210012423).
The spelling of 201200010321 in words is "two hundred one billion, two hundred million, ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •