Base | Representation |
---|---|
bin | 101111110010110101000011… |
… | …000110011101010101001011 |
3 | 1000120021000211111000001102111 |
4 | 233302311003012131111023 |
5 | 210022413343232400021 |
6 | 2023021021142243151 |
7 | 62163346466323303 |
oct | 5762650306352513 |
9 | 1016230744001374 |
10 | 210201120200011 |
11 | 60a8188146a3a6 |
12 | 1b6aa475a264b7 |
13 | 9039b5a83a6c5 |
14 | 39c9b07910603 |
15 | 1947c3097c8e1 |
hex | bf2d4319d54b |
210201120200011 has 8 divisors (see below), whose sum is σ = 210760434540000. Its totient is φ = 209642211018240.
The previous prime is 210201120199991. The next prime is 210201120200023. The reversal of 210201120200011 is 110002021102012.
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 210201120200011 - 217 = 210201120068939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210201120199964 and 210201120200000.
It is not an unprimeable number, because it can be changed into a prime (210201120200081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100250536 + ... + 102325813.
It is an arithmetic number, because the mean of its divisors is an integer number (26345054317500).
Almost surely, 2210201120200011 is an apocalyptic number.
210201120200011 is a deficient number, since it is larger than the sum of its proper divisors (559314339989).
210201120200011 is a wasteful number, since it uses less digits than its factorization.
210201120200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202579109.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210201120200011 its reverse (110002021102012), we get a palindrome (320203141302023).
The spelling of 210201120200011 in words is "two hundred ten trillion, two hundred one billion, one hundred twenty million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •