Base | Representation |
---|---|
bin | 101111110010110101001000… |
… | …100000110101110010010001 |
3 | 1000120021001001210212021100011 |
4 | 233302311020200311302101 |
5 | 210022414040004031001 |
6 | 2023021034144354521 |
7 | 62163351651166162 |
oct | 5762651040656221 |
9 | 1016231053767304 |
10 | 210201211002001 |
11 | 60a8191874926a |
12 | 1b6aa4a0315a41 |
13 | 9039b735b06ab |
14 | 39c9b159c9769 |
15 | 1947c38916d51 |
hex | bf2d48835c91 |
210201211002001 has 8 divisors (see below), whose sum is σ = 217151810613504. Its totient is φ = 203261231102160.
The previous prime is 210201211001987. The next prime is 210201211002019. The reversal of 210201211002001 is 100200112102012.
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 210201211002001 - 229 = 210200674131089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210201211002071) 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 7 ways as a sum of consecutive naturals, for example, 2654887675 + ... + 2654966848.
It is an arithmetic number, because the mean of its divisors is an integer number (27143976326688).
Almost surely, 2210201211002001 is an apocalyptic number.
It is an amenable number.
210201211002001 is a deficient number, since it is larger than the sum of its proper divisors (6950599611503).
210201211002001 is a wasteful number, since it uses less digits than its factorization.
210201211002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5309855831.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210201211002001 its reverse (100200112102012), we get a palindrome (310401323104013).
The spelling of 210201211002001 in words is "two hundred ten trillion, two hundred one billion, two hundred eleven million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •