Base | Representation |
---|---|
bin | 101111110000000011111111… |
… | …000111101110110110011001 |
3 | 1000112120212002202102020000012 |
4 | 233300003333013232312121 |
5 | 210011310012241402301 |
6 | 2022353415542451305 |
7 | 62143536245660516 |
oct | 5760037707566631 |
9 | 1015525082366005 |
10 | 210011001122201 |
11 | 60a091901812a4 |
12 | 1b679657433b35 |
13 | 9024c4c645766 |
14 | 39c082dc3630d |
15 | 1942d04be3ebb |
hex | bf00ff1eed99 |
210011001122201 has 8 divisors (see below), whose sum is σ = 221720188603680. Its totient is φ = 198367411330368.
The previous prime is 210011001122179. The next prime is 210011001122213. The reversal of 210011001122201 is 102221100110012.
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 210011001122201 - 226 = 210010934013337 is a prime.
It is not an unprimeable number, because it can be changed into a prime (210011001122801) 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, 16399415831 + ... + 16399428636.
It is an arithmetic number, because the mean of its divisors is an integer number (27715023575460).
Almost surely, 2210011001122201 is an apocalyptic number.
It is an amenable number.
210011001122201 is a deficient number, since it is larger than the sum of its proper divisors (11709187481479).
210011001122201 is a wasteful number, since it uses less digits than its factorization.
210011001122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32798844823.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 210011001122201 its reverse (102221100110012), we get a palindrome (312232101232213).
The spelling of 210011001122201 in words is "two hundred ten trillion, eleven billion, one million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •