Base | Representation |
---|---|
bin | 10111000000101010000010… |
… | …000010011101001010111001 |
3 | 111021022122102000110002121010 |
4 | 113000222002002131022321 |
5 | 101231031002441011301 |
6 | 555122421445504133 |
7 | 30213321216225354 |
oct | 2700520202351271 |
9 | 437278360402533 |
10 | 101200201110201 |
11 | 2a277845274346 |
12 | b42533a712049 |
13 | 44611a42b636b |
14 | 1adc189d2b29b |
15 | ba76b1e835d6 |
hex | 5c0a8209d2b9 |
101200201110201 has 8 divisors (see below), whose sum is σ = 134936945638144. Its totient is φ = 67465128661200.
The previous prime is 101200201110133. The next prime is 101200201110209. The reversal of 101200201110201 is 102011102002101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101200201110201 - 230 = 101199127368377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101200201110209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 417878506 + ... + 418120611.
It is an arithmetic number, because the mean of its divisors is an integer number (16867118204768).
Almost surely, 2101200201110201 is an apocalyptic number.
It is an amenable number.
101200201110201 is a deficient number, since it is larger than the sum of its proper divisors (33736744527943).
101200201110201 is an equidigital number, since it uses as much as digits as its factorization.
101200201110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836039471.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101200201110201 its reverse (102011102002101), we get a palindrome (203211303112302).
The spelling of 101200201110201 in words is "one hundred one 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.063 sec. • engine limits •