Base | Representation |
---|---|
bin | 111100010010010010111111… |
… | …000010000101111100100101 |
3 | 1021202210011000021010211000002 |
4 | 330102102333002011330211 |
5 | 234223023434241113243 |
6 | 2335523405321231045 |
7 | 106563512331450644 |
oct | 7422227702057445 |
9 | 1252704007124002 |
10 | 265140126113573 |
11 | 77533329003047 |
12 | 258a1b23932485 |
13 | b4c37b694b119 |
14 | 4968bc9d9d35b |
15 | 209bd83196eb8 |
hex | f124bf085f25 |
265140126113573 has 2 divisors, whose sum is σ = 265140126113574. Its totient is φ = 265140126113572.
The previous prime is 265140126113561. The next prime is 265140126113581. The reversal of 265140126113573 is 375311621041562.
265140126113573 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 264604650488929 + 535475624644 = 16266673^2 + 731762^2 .
It is a cyclic number.
It is not a de Polignac number, because 265140126113573 - 224 = 265140109336357 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (265148126113573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 132570063056786 + 132570063056787.
It is an arithmetic number, because the mean of its divisors is an integer number (132570063056787).
Almost surely, 2265140126113573 is an apocalyptic number.
It is an amenable number.
265140126113573 is a deficient number, since it is larger than the sum of its proper divisors (1).
265140126113573 is an equidigital number, since it uses as much as digits as its factorization.
265140126113573 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 907200, while the sum is 47.
The spelling of 265140126113573 in words is "two hundred sixty-five trillion, one hundred forty billion, one hundred twenty-six million, one hundred thirteen thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •