Base | Representation |
---|---|
bin | 1111011110101101010… |
… | …0111001111110000001 |
3 | 221102102220011020000121 |
4 | 3313223110321332001 |
5 | 13324121412144022 |
6 | 322101025220241 |
7 | 25133161213513 |
oct | 3675324717601 |
9 | 842386136017 |
10 | 265941131137 |
11 | a286a920aa0 |
12 | 4365b191681 |
13 | 1c1028a2c76 |
14 | cc2ba1bbb3 |
15 | 6db75822c7 |
hex | 3deb539f81 |
265941131137 has 4 divisors (see below), whose sum is σ = 290117597616. Its totient is φ = 241764664660.
The previous prime is 265941131117. The next prime is 265941131149. The reversal of 265941131137 is 731131149562.
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 a de Polignac number, because none of the positive numbers 2k-265941131137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 265941131093 and 265941131102.
It is not an unprimeable number, because it can be changed into a prime (265941131117) 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 in 3 ways as a sum of consecutive naturals, for example, 12088233223 + ... + 12088233244.
It is an arithmetic number, because the mean of its divisors is an integer number (72529399404).
Almost surely, 2265941131137 is an apocalyptic number.
It is an amenable number.
265941131137 is a deficient number, since it is larger than the sum of its proper divisors (24176466479).
265941131137 is a wasteful number, since it uses less digits than its factorization.
265941131137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24176466478.
The product of its digits is 136080, while the sum is 43.
The spelling of 265941131137 in words is "two hundred sixty-five billion, nine hundred forty-one million, one hundred thirty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •