Base | Representation |
---|---|
bin | 10111000000101001111100… |
… | …100111101010110010010001 |
3 | 111021022122011200101110222202 |
4 | 113000221330213222302101 |
5 | 101231030311202431001 |
6 | 555122404441212545 |
7 | 30213316033431026 |
oct | 2700517447526221 |
9 | 437278150343882 |
10 | 101200110202001 |
11 | 2a2777a8a226a8 |
12 | b425314191155 |
13 | 446118b506c25 |
14 | 1adc17bc2554d |
15 | ba76a8ec796b |
hex | 5c0a7c9eac91 |
101200110202001 has 24 divisors (see below), whose sum is σ = 108408357817344. Its totient is φ = 94445884863360.
The previous prime is 101200110201989. The next prime is 101200110202069. The reversal of 101200110202001 is 100202011002101.
It is a de Polignac number, because none of the positive numbers 2k-101200110202001 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 (101200110202601) 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 23 ways as a sum of consecutive naturals, for example, 22856 + ... + 14226761.
It is an arithmetic number, because the mean of its divisors is an integer number (4517014909056).
Almost surely, 2101200110202001 is an apocalyptic number.
It is an amenable number.
101200110202001 is a deficient number, since it is larger than the sum of its proper divisors (7208247615343).
101200110202001 is a wasteful number, since it uses less digits than its factorization.
101200110202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14249949 (or 14249930 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101200110202001 its reverse (100202011002101), we get a palindrome (201402121204102).
The spelling of 101200110202001 in words is "one hundred one trillion, two hundred billion, one hundred ten million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •