Base | Representation |
---|---|
bin | 10111000000101010111000… |
… | …010001011101001101101011 |
3 | 111021022201202102120220111021 |
4 | 113000222320101131031223 |
5 | 101231034333404342303 |
6 | 555123052032113311 |
7 | 30213352605245026 |
oct | 2700527021351553 |
9 | 437281672526437 |
10 | 101201111012203 |
11 | 2a27817194a174 |
12 | b425553395837 |
13 | 44612ba968b07 |
14 | 1adc234b041bd |
15 | ba7716cb8ebd |
hex | 5c0ab845d36b |
101201111012203 has 2 divisors, whose sum is σ = 101201111012204. Its totient is φ = 101201111012202.
The previous prime is 101201111012173. The next prime is 101201111012297. The reversal of 101201111012203 is 302210111102101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101201111012203 - 29 = 101201111011691 is a prime.
It is not a weakly prime, because it can be changed into another prime (101201111012303) 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 as a sum of consecutive naturals, namely, 50600555506101 + 50600555506102.
It is an arithmetic number, because the mean of its divisors is an integer number (50600555506102).
Almost surely, 2101201111012203 is an apocalyptic number.
101201111012203 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201111012203 is an equidigital number, since it uses as much as digits as its factorization.
101201111012203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 101201111012203 its reverse (302210111102101), we get a palindrome (403411222114304).
The spelling of 101201111012203 in words is "one hundred one trillion, two hundred one billion, one hundred eleven million, twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •