Base | Representation |
---|---|
bin | 1001010001101110010101… |
… | …1010001010010011001101 |
3 | 1100010010020120221111010201 |
4 | 2110123211122022103031 |
5 | 2314104301401413401 |
6 | 33405510052133501 |
7 | 2101635005445250 |
oct | 224334532122315 |
9 | 40103216844121 |
10 | 10200101201101 |
11 | 3282925237099 |
12 | 1188a21307291 |
13 | 58cb3341bab6 |
14 | 27398a835097 |
15 | 12a4dc207b01 |
hex | 946e568a4cd |
10200101201101 has 8 divisors (see below), whose sum is σ = 11772676917504. Its totient is φ = 8656380085200.
The previous prime is 10200101201099. The next prime is 10200101201113. The reversal of 10200101201101 is 10110210100201.
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 10200101201101 - 21 = 10200101201099 is a prime.
It is a super-2 number, since 2×102001012011012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200101201201) 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, 7213649365 + ... + 7213650778.
It is an arithmetic number, because the mean of its divisors is an integer number (1471584614688).
Almost surely, 210200101201101 is an apocalyptic number.
It is an amenable number.
10200101201101 is a deficient number, since it is larger than the sum of its proper divisors (1572575716403).
10200101201101 is a wasteful number, since it uses less digits than its factorization.
10200101201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14427300251.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10200101201101 its reverse (10110210100201), we get a palindrome (20310311301302).
The spelling of 10200101201101 in words is "ten trillion, two hundred billion, one hundred one million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •