Base | Representation |
---|---|
bin | 101101101111111111100111… |
… | …110000101000011001101001 |
3 | 222101102111202021022222101220 |
4 | 231233333213300220121221 |
5 | 202333112013111413001 |
6 | 1551534411033532253 |
7 | 60244646565640425 |
oct | 5557774760503151 |
9 | 871374667288356 |
10 | 201210221201001 |
11 | 59125859367aa1 |
12 | 1a697a7bb74089 |
13 | 88370723322cc |
14 | 37988ab811b85 |
15 | 183de1627dc36 |
hex | b6ffe7c28669 |
201210221201001 has 8 divisors (see below), whose sum is σ = 268280446371264. Its totient is φ = 134140071749040.
The previous prime is 201210221200993. The next prime is 201210221201057. The reversal of 201210221201001 is 100102122012102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201210221201001 - 23 = 201210221200993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201210221221001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12408126 + ... + 23587751.
It is an arithmetic number, because the mean of its divisors is an integer number (33535055796408).
Almost surely, 2201210221201001 is an apocalyptic number.
It is an amenable number.
201210221201001 is a deficient number, since it is larger than the sum of its proper divisors (67070225170263).
201210221201001 is a wasteful number, since it uses less digits than its factorization.
201210221201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37859151.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201210221201001 its reverse (100102122012102), we get a palindrome (301312343213103).
The spelling of 201210221201001 in words is "two hundred one trillion, two hundred ten billion, two hundred twenty-one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •