Base | Representation |
---|---|
bin | 10111110110000… |
… | …11011110010101 |
3 | 111221101120201021 |
4 | 23323003132111 |
5 | 402201430401 |
6 | 31503201141 |
7 | 4646141065 |
oct | 1373033625 |
9 | 457346637 |
10 | 200030101 |
11 | a2a03637 |
12 | 56ba61b1 |
13 | 32597c0b |
14 | 1c7cd3a5 |
15 | 128632a1 |
hex | bec3795 |
200030101 has 2 divisors, whose sum is σ = 200030102. Its totient is φ = 200030100.
The previous prime is 200030099. The next prime is 200030107. The reversal of 200030101 is 101030002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 151044100 + 48986001 = 12290^2 + 6999^2 .
It is a cyclic number.
It is not a de Polignac number, because 200030101 - 21 = 200030099 is a prime.
Together with 200030099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200030107) 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, 100015050 + 100015051.
It is an arithmetic number, because the mean of its divisors is an integer number (100015051).
Almost surely, 2200030101 is an apocalyptic number.
It is an amenable number.
200030101 is a deficient number, since it is larger than the sum of its proper divisors (1).
200030101 is an equidigital number, since it uses as much as digits as its factorization.
200030101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 7.
The square root of 200030101 is about 14143.1998147520. The cubic root of 200030101 is about 584.8328847901.
Adding to 200030101 its reverse (101030002), we get a palindrome (301060103).
Subtracting from 200030101 its reverse (101030002), we obtain a palindrome (99000099).
The spelling of 200030101 in words is "two hundred million, thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •