Base | Representation |
---|---|
bin | 101101100011000100011010… |
… | …010111011110001010010001 |
3 | 222021021121010110001012210201 |
4 | 231203010122113132022101 |
5 | 202224033440033410301 |
6 | 1550014354544255201 |
7 | 60123534126261601 |
oct | 5543043227361221 |
9 | 867247113035721 |
10 | 200322012013201 |
11 | 589130a74409a1 |
12 | 1a5738b8611501 |
13 | 87a1391587770 |
14 | 37678cc352c01 |
15 | 1825c7de51201 |
hex | b6311a5de291 |
200322012013201 has 16 divisors (see below), whose sum is σ = 215770021084800. Its totient is φ = 184879523420928.
The previous prime is 200322012013157. The next prime is 200322012013231. The reversal of 200322012013201 is 102310210223002.
It is a cyclic number.
It is not a de Polignac number, because 200322012013201 - 213 = 200322012005009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200322012013231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2252815020 + ... + 2252903938.
It is an arithmetic number, because the mean of its divisors is an integer number (13485626317800).
Almost surely, 2200322012013201 is an apocalyptic number.
It is an amenable number.
200322012013201 is a deficient number, since it is larger than the sum of its proper divisors (15448009071599).
200322012013201 is a wasteful number, since it uses less digits than its factorization.
200322012013201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118008.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 200322012013201 its reverse (102310210223002), we get a palindrome (302632222236203).
The spelling of 200322012013201 in words is "two hundred trillion, three hundred twenty-two billion, twelve million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •