Base | Representation |
---|---|
bin | 101111111110011111000001… |
… | …010010011111010010001011 |
3 | 1000200002121022020001202102110 |
4 | 233332133001102133102023 |
5 | 210124024300401400021 |
6 | 2024433005505033403 |
7 | 62305253524433532 |
oct | 5776370122372213 |
9 | 1020077266052373 |
10 | 211002101200011 |
11 | 6126054134a9a0 |
12 | 1b7b9754925863 |
13 | 9097549b01044 |
14 | 3a167b0279319 |
15 | 195d9aee4b476 |
hex | bfe7c149f48b |
211002101200011 has 128 divisors (see below), whose sum is σ = 342778700759040. Its totient is φ = 113786760960000.
The previous prime is 211002101200001. The next prime is 211002101200013. The reversal of 211002101200011 is 110002101200112.
It is not a de Polignac number, because 211002101200011 - 215 = 211002101167243 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 211002101200011.
It is not an unprimeable number, because it can be changed into a prime (211002101200013) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 24820852261 + ... + 24820860761.
It is an arithmetic number, because the mean of its divisors is an integer number (2677958599680).
Almost surely, 2211002101200011 is an apocalyptic number.
211002101200011 is a deficient number, since it is larger than the sum of its proper divisors (131776599559029).
211002101200011 is a wasteful number, since it uses less digits than its factorization.
211002101200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13105.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 211002101200011 its reverse (110002101200112), we get a palindrome (321004202400123).
It can be divided in two parts, 211002101 and 200011, that added together give a palindrome (211202112).
The spelling of 211002101200011 in words is "two hundred eleven trillion, two billion, one hundred one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •