Base | Representation |
---|---|
bin | 10111110110101… |
… | …00110011111001 |
3 | 111221112012010100 |
4 | 23323110303321 |
5 | 402211213423 |
6 | 31504510013 |
7 | 4646555112 |
oct | 1373246371 |
9 | 457465110 |
10 | 200101113 |
11 | a2a51a23 |
12 | 5701b309 |
13 | 325c1334 |
14 | 1c80b209 |
15 | 12879343 |
hex | bed4cf9 |
200101113 has 6 divisors (see below), whose sum is σ = 289034954. Its totient is φ = 133400736.
The previous prime is 200101079. The next prime is 200101133. The reversal of 200101113 is 311101002.
It can be written as a sum of positive squares in only one way, i.e., 127306089 + 72795024 = 11283^2 + 8532^2 .
It is a de Polignac number, because none of the positive numbers 2k-200101113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 22233457 = 200101113 / (2 + 0 + 0 + 1 + 0 + 1 + 1 + 1 + 3).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200101095 and 200101104.
It is not an unprimeable number, because it can be changed into a prime (200101133) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11116720 + ... + 11116737.
Almost surely, 2200101113 is an apocalyptic number.
It is an amenable number.
200101113 is a deficient number, since it is larger than the sum of its proper divisors (88933841).
200101113 is a wasteful number, since it uses less digits than its factorization.
200101113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22233463 (or 22233460 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 200101113 is about 14145.7100564093. The cubic root of 200101113 is about 584.9020831076.
Adding to 200101113 its reverse (311101002), we get a palindrome (511202115).
The spelling of 200101113 in words is "two hundred million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •