Base | Representation |
---|---|
bin | 1011101001011011110… |
… | …1000111111001000001 |
3 | 201010111101112011011101 |
4 | 2322112331013321001 |
5 | 11234301340213441 |
6 | 231531501014401 |
7 | 20312456203315 |
oct | 2722675077101 |
9 | 633441464141 |
10 | 200101101121 |
11 | 77953944a49 |
12 | 32945554401 |
13 | 15b3c259c1c |
14 | 99836bbb45 |
15 | 5312295231 |
hex | 2e96f47e41 |
200101101121 has 4 divisors (see below), whose sum is σ = 202082300244. Its totient is φ = 198119902000.
The previous prime is 200101101103. The next prime is 200101101127. The reversal of 200101101121 is 121101101002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 150222132225 + 49878968896 = 387585^2 + 223336^2 .
It is a cyclic number.
It is not a de Polignac number, because 200101101121 - 27 = 200101100993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200101101098 and 200101101107.
It is not an unprimeable number, because it can be changed into a prime (200101101127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 990599410 + ... + 990599611.
It is an arithmetic number, because the mean of its divisors is an integer number (50520575061).
Almost surely, 2200101101121 is an apocalyptic number.
It is an amenable number.
200101101121 is a deficient number, since it is larger than the sum of its proper divisors (1981199123).
200101101121 is a wasteful number, since it uses less digits than its factorization.
200101101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1981199122.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 200101101121 its reverse (121101101002), we get a palindrome (321202202123).
The spelling of 200101101121 in words is "two hundred billion, one hundred one million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •