Base | Representation |
---|---|
bin | 10111110110001… |
… | …01111010100101 |
3 | 111221102002102122 |
4 | 23323011322211 |
5 | 402202240401 |
6 | 31503315325 |
7 | 4646212202 |
oct | 1373057245 |
9 | 457362378 |
10 | 200040101 |
11 | a2a100a8 |
12 | 56babb45 |
13 | 3259c631 |
14 | 1c7d2ca9 |
15 | 1286621b |
hex | bec5ea5 |
200040101 has 2 divisors, whose sum is σ = 200040102. Its totient is φ = 200040100.
The previous prime is 200040097. The next prime is 200040103. The reversal of 200040101 is 101040002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115584001 + 84456100 = 10751^2 + 9190^2 .
It is a cyclic number.
It is not a de Polignac number, because 200040101 - 22 = 200040097 is a prime.
Together with 200040103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200040103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100020050 + 100020051.
It is an arithmetic number, because the mean of its divisors is an integer number (100020051).
Almost surely, 2200040101 is an apocalyptic number.
It is an amenable number.
200040101 is a deficient number, since it is larger than the sum of its proper divisors (1).
200040101 is an equidigital number, since it uses as much as digits as its factorization.
200040101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 8.
The square root of 200040101 is about 14143.5533371215. The cubic root of 200040101 is about 584.8426303757.
Adding to 200040101 its reverse (101040002), we get a palindrome (301080103).
Subtracting from 200040101 its reverse (101040002), we obtain a palindrome (99000099).
The spelling of 200040101 in words is "two hundred million, forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •