Base | Representation |
---|---|
bin | 101101011110100010111101… |
… | …001111100000101111010011 |
3 | 222020011212220020222200102111 |
4 | 231132202331033200233103 |
5 | 202203440430233001321 |
6 | 1545215514325330151 |
7 | 60062222200615003 |
oct | 5536427517405723 |
9 | 866155806880374 |
10 | 200011212000211 |
11 | 58803307990027 |
12 | 1a52361a266957 |
13 | 877ac900b2931 |
14 | 3756846b1c003 |
15 | 181cb3d5585e1 |
hex | b5e8bd3e0bd3 |
200011212000211 has 8 divisors (see below), whose sum is σ = 200131845794048. Its totient is φ = 199890592344000.
The previous prime is 200011212000203. The next prime is 200011212000283. The reversal of 200011212000211 is 112000212110002.
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 200011212000211 - 23 = 200011212000203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200011212000191 and 200011212000200.
It is not an unprimeable number, because it can be changed into a prime (200011212030211) 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, 24837646 + ... + 31889356.
It is an arithmetic number, because the mean of its divisors is an integer number (25016480724256).
Almost surely, 2200011212000211 is an apocalyptic number.
200011212000211 is a deficient number, since it is larger than the sum of its proper divisors (120633793837).
200011212000211 is a wasteful number, since it uses less digits than its factorization.
200011212000211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7068813.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200011212000211 its reverse (112000212110002), we get a palindrome (312011424110213).
The spelling of 200011212000211 in words is "two hundred trillion, eleven billion, two hundred twelve million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •