Base | Representation |
---|---|
bin | 10111000000101010110010… |
… | …010100101101010010101001 |
3 | 111021022201111110202222112012 |
4 | 113000222302110231102221 |
5 | 101231034132331414233 |
6 | 555123034104525305 |
7 | 30213350254000601 |
oct | 2700526224552251 |
9 | 437281443688465 |
10 | 101201011201193 |
11 | 2a278120577732 |
12 | b425525a80835 |
13 | 44612a3090347 |
14 | 1adc225761c01 |
15 | ba770d150548 |
hex | 5c0ab252d4a9 |
101201011201193 has 2 divisors, whose sum is σ = 101201011201194. Its totient is φ = 101201011201192.
The previous prime is 101201011201159. The next prime is 101201011201231. The reversal of 101201011201193 is 391102110102101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76959686292889 + 24241324908304 = 8772667^2 + 4923548^2 .
It is a cyclic number.
It is not a de Polignac number, because 101201011201193 - 214 = 101201011184809 is a prime.
It is not a weakly prime, because it can be changed into another prime (101201011201993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50600505600596 + 50600505600597.
It is an arithmetic number, because the mean of its divisors is an integer number (50600505600597).
Almost surely, 2101201011201193 is an apocalyptic number.
It is an amenable number.
101201011201193 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201011201193 is an equidigital number, since it uses as much as digits as its factorization.
101201011201193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 23.
Adding to 101201011201193 its reverse (391102110102101), we get a palindrome (492303121303294).
The spelling of 101201011201193 in words is "one hundred one trillion, two hundred one billion, eleven million, two hundred one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •