Base | Representation |
---|---|
bin | 111000101100111000… |
… | …1010000000000011101 |
3 | 102122022000122101120221 |
4 | 1301121301100000131 |
5 | 3443333340322013 |
6 | 131534350041341 |
7 | 11540311562161 |
oct | 1613161200035 |
9 | 378260571527 |
10 | 121765167133 |
11 | 47705298335 |
12 | 1b722aa9251 |
13 | b636acc76c |
14 | 5c71952ca1 |
15 | 3279e2d08d |
hex | 1c59c5001d |
121765167133 has 4 divisors (see below), whose sum is σ = 128173860160. Its totient is φ = 115356474108.
The previous prime is 121765167107. The next prime is 121765167191. The reversal of 121765167133 is 331761567121.
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, and also an emirpimes, since its reverse is a distinct semiprime: 331761567121 = 151 ⋅2197096471.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121765167133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121765167133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121765167103) 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, 3204346485 + ... + 3204346522.
It is an arithmetic number, because the mean of its divisors is an integer number (32043465040).
Almost surely, 2121765167133 is an apocalyptic number.
It is an amenable number.
121765167133 is a deficient number, since it is larger than the sum of its proper divisors (6408693027).
121765167133 is an equidigital number, since it uses as much as digits as its factorization.
121765167133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6408693026.
The product of its digits is 158760, while the sum is 43.
The spelling of 121765167133 in words is "one hundred twenty-one billion, seven hundred sixty-five million, one hundred sixty-seven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •