Base | Representation |
---|---|
bin | 10111000000101010110111… |
… | …101011101011101101101001 |
3 | 111021022201201201221211101111 |
4 | 113000222313223223231221 |
5 | 101231034323341010441 |
6 | 555123051035550321 |
7 | 30213352425134005 |
oct | 2700526753535551 |
9 | 437281651854344 |
10 | 101201101110121 |
11 | 2a2781672a6631 |
12 | b42554bbbb3a1 |
13 | 44612b88ac9ac |
14 | 1adc233687705 |
15 | ba7715eb0081 |
hex | 5c0ab7aebb69 |
101201101110121 has 4 divisors (see below), whose sum is σ = 101201147267472. Its totient is φ = 101201054952772.
The previous prime is 101201101110107. The next prime is 101201101110127. The reversal of 101201101110121 is 121011101102101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101201101110121 - 27 = 101201101109993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101201101110127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19616791 + ... + 24232636.
It is an arithmetic number, because the mean of its divisors is an integer number (25300286816868).
Almost surely, 2101201101110121 is an apocalyptic number.
It is an amenable number.
101201101110121 is a deficient number, since it is larger than the sum of its proper divisors (46157351).
101201101110121 is an equidigital number, since it uses as much as digits as its factorization.
101201101110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46157350.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101201101110121 its reverse (121011101102101), we get a palindrome (222212202212222).
The spelling of 101201101110121 in words is "one hundred one trillion, two hundred one billion, one hundred one million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •