Base | Representation |
---|---|
bin | 1001010001101110101101… |
… | …0111010010001010111001 |
3 | 1100010010111112221101122202 |
4 | 2110123223113102022321 |
5 | 2314110002441011301 |
6 | 33405524021355545 |
7 | 2101640330611364 |
oct | 224335327221271 |
9 | 40103445841582 |
10 | 10200201110201 |
11 | 32829766762a3 |
12 | 1188a4a868bb5 |
13 | 58cb4b0300cb |
14 | 273999c010db |
15 | 12a4e5d9066b |
hex | 946eb5d22b9 |
10200201110201 has 8 divisors (see below), whose sum is σ = 10438032447744. Its totient is φ = 9962397834480.
The previous prime is 10200201110167. The next prime is 10200201110249. The reversal of 10200201110201 is 10201110200201.
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 10200201110201 - 26 = 10200201110137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10200201110261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6279110 + ... + 7734831.
It is an arithmetic number, because the mean of its divisors is an integer number (1304754055968).
Almost surely, 210200201110201 is an apocalyptic number.
It is an amenable number.
10200201110201 is a deficient number, since it is larger than the sum of its proper divisors (237831337543).
10200201110201 is a wasteful number, since it uses less digits than its factorization.
10200201110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14030911.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10200201110201 its reverse (10201110200201), we get a palindrome (20401311310402).
The spelling of 10200201110201 in words is "ten trillion, two hundred billion, two hundred one million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •