Base | Representation |
---|---|
bin | 1001010001101111000111… |
… | …1010011111000000010101 |
3 | 1100010010210012201102122101 |
4 | 2110123301322133000111 |
5 | 2314110214104013414 |
6 | 33405542545002101 |
7 | 2101643133640135 |
oct | 224336172370025 |
9 | 40103705642571 |
10 | 10200311001109 |
11 | 3282a22702a29 |
12 | 1188a7b623331 |
13 | 58cb67a27908 |
14 | 2739aa648ac5 |
15 | 12a50084aa74 |
hex | 946f1e9f015 |
10200311001109 has 4 divisors (see below), whose sum is σ = 10200492431680. Its totient is φ = 10200129570540.
The previous prime is 10200311001007. The next prime is 10200311001119. The reversal of 10200311001109 is 90110011300201.
10200311001109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10200311001109 - 27 = 10200311000981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200311001119) 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, 90630927 + ... + 90743404.
It is an arithmetic number, because the mean of its divisors is an integer number (2550123107920).
Almost surely, 210200311001109 is an apocalyptic number.
It is an amenable number.
10200311001109 is a deficient number, since it is larger than the sum of its proper divisors (181430571).
10200311001109 is an equidigital number, since it uses as much as digits as its factorization.
10200311001109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181430570.
The product of its (nonzero) digits is 54, while the sum is 19.
The spelling of 10200311001109 in words is "ten trillion, two hundred billion, three hundred eleven million, one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •