Base | Representation |
---|---|
bin | 1001010001101110010111… |
… | …1100011111100100001101 |
3 | 1100010010021012212201211001 |
4 | 2110123211330133210031 |
5 | 2314104311202413401 |
6 | 33405511013100301 |
7 | 2101635145111312 |
oct | 224334574374415 |
9 | 40103235781731 |
10 | 10200110201101 |
11 | 328292a323a07 |
12 | 1188a24327691 |
13 | 58cb35250442 |
14 | 27398bad8d09 |
15 | 12a4dcdd4601 |
hex | 946e5f1f90d |
10200110201101 has 8 divisors (see below), whose sum is σ = 10553323898880. Its totient is φ = 9846995554032.
The previous prime is 10200110201077. The next prime is 10200110201119. The reversal of 10200110201101 is 10110201100201.
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 10200110201101 - 221 = 10200108103949 is a prime.
It is a super-2 number, since 2×102001102011012 (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 (10200110201131) 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, 24553125 + ... + 24965098.
It is an arithmetic number, because the mean of its divisors is an integer number (1319165487360).
Almost surely, 210200110201101 is an apocalyptic number.
It is an amenable number.
10200110201101 is a deficient number, since it is larger than the sum of its proper divisors (353213697779).
10200110201101 is an equidigital number, since it uses as much as digits as its factorization.
10200110201101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49525355.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10200110201101 its reverse (10110201100201), we get a palindrome (20310311301302).
The spelling of 10200110201101 in words is "ten trillion, two hundred billion, one hundred ten million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •