Base | Representation |
---|---|
bin | 10111000000101010111101… |
… | …110001001000010001101101 |
3 | 111021022201222212001120221002 |
4 | 113000222331301020101231 |
5 | 101231040031004414013 |
6 | 555123105124050045 |
7 | 30213355104655310 |
oct | 2700527561102155 |
9 | 437281885046832 |
10 | 101201203201133 |
11 | 2a278209996072 |
12 | b42557a233925 |
13 | 4461303aa6189 |
14 | 1adc243060977 |
15 | ba771ee29358 |
hex | 5c0abdc4846d |
101201203201133 has 8 divisors (see below), whose sum is σ = 115658669669952. Its totient is φ = 86743774663776.
The previous prime is 101201203201121. The next prime is 101201203201151. The reversal of 101201203201133 is 331102302102101.
It is a happy number.
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 101201203201133 - 24 = 101201203201117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101201203201433) 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, 3515360 + ... + 14654697.
It is an arithmetic number, because the mean of its divisors is an integer number (14457333708744).
Almost surely, 2101201203201133 is an apocalyptic number.
It is an amenable number.
101201203201133 is a deficient number, since it is larger than the sum of its proper divisors (14457466468819).
101201203201133 is an equidigital number, since it uses as much as digits as its factorization.
101201203201133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18965731.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 101201203201133 its reverse (331102302102101), we get a palindrome (432303505303234).
The spelling of 101201203201133 in words is "one hundred one trillion, two hundred one billion, two hundred three million, two hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •