Base | Representation |
---|---|
bin | 1011101001011110011… |
… | …1001010100010010001 |
3 | 201010112011021001222010 |
4 | 2322113213022202101 |
5 | 11234312200401001 |
6 | 231532533133133 |
7 | 20312651654211 |
oct | 2722747124221 |
9 | 633464231863 |
10 | 200112122001 |
11 | 7795a092110 |
12 | 3294918a1a9 |
13 | 15b4161835c |
14 | 9984d4a241 |
15 | 53132208d6 |
hex | 2e979ca891 |
200112122001 has 32 divisors (see below), whose sum is σ = 294448780800. Its totient is φ = 119874142080.
The previous prime is 200112121967. The next prime is 200112122003. The reversal of 200112122001 is 100221211002.
200112122001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 200112122001 - 223 = 200103733393 is a prime.
It is a super-2 number, since 2×2001121220012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200112122003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9349530 + ... + 9370908.
It is an arithmetic number, because the mean of its divisors is an integer number (9201524400).
Almost surely, 2200112122001 is an apocalyptic number.
It is an amenable number.
200112122001 is a deficient number, since it is larger than the sum of its proper divisors (94336658799).
200112122001 is a wasteful number, since it uses less digits than its factorization.
200112122001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24669.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200112122001 its reverse (100221211002), we get a palindrome (300333333003).
The spelling of 200112122001 in words is "two hundred billion, one hundred twelve million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •