Base | Representation |
---|---|
bin | 1011101001011011110… |
… | …0110110100101000101 |
3 | 201010111101101112220011 |
4 | 2322112330312211011 |
5 | 11234301330431323 |
6 | 231531455310221 |
7 | 20312455456510 |
oct | 2722674664505 |
9 | 633441345804 |
10 | 200101030213 |
11 | 779538a6747 |
12 | 3294551b371 |
13 | 15b3c233876 |
14 | 998369dd77 |
15 | 531227e20d |
hex | 2e96f36945 |
200101030213 has 8 divisors (see below), whose sum is σ = 228692172800. Its totient is φ = 171511207920.
The previous prime is 200101030189. The next prime is 200101030231. The reversal of 200101030213 is 312030101002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200101030213 - 225 = 200067475781 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200101030193 and 200101030202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200101034213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19363 + ... + 632911.
It is an arithmetic number, because the mean of its divisors is an integer number (28586521600).
Almost surely, 2200101030213 is an apocalyptic number.
It is an amenable number.
200101030213 is a deficient number, since it is larger than the sum of its proper divisors (28591142587).
200101030213 is an equidigital number, since it uses as much as digits as its factorization.
200101030213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 660147.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 200101030213 its reverse (312030101002), we get a palindrome (512131131215).
The spelling of 200101030213 in words is "two hundred billion, one hundred one million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •