Base | Representation |
---|---|
bin | 101111101111111011101101… |
… | …010010110011101101010001 |
3 | 1000112120000011021011011120012 |
4 | 233233323231102303231101 |
5 | 210011133311144214301 |
6 | 2022345345524124305 |
7 | 62143103051356430 |
oct | 5757735522635521 |
9 | 1015500137134505 |
10 | 210002112101201 |
11 | 60a054395a0252 |
12 | 1b677996536695 |
13 | 9024163b81314 |
14 | 39c022946d117 |
15 | 1942984639ebb |
hex | befeed4b3b51 |
210002112101201 has 8 divisors (see below), whose sum is σ = 240002645467200. Its totient is φ = 180001636644528.
The previous prime is 210002112101183. The next prime is 210002112101207. The reversal of 210002112101201 is 102101211200012.
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 210002112101201 - 26 = 210002112101137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (210002112101207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6406526 + ... + 21472023.
It is an arithmetic number, because the mean of its divisors is an integer number (30000330683400).
Almost surely, 2210002112101201 is an apocalyptic number.
It is an amenable number.
210002112101201 is a deficient number, since it is larger than the sum of its proper divisors (30000533365999).
210002112101201 is a wasteful number, since it uses less digits than its factorization.
210002112101201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28954663.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 210002112101201 its reverse (102101211200012), we get a palindrome (312103323301213).
The spelling of 210002112101201 in words is "two hundred ten trillion, two billion, one hundred twelve million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •