Base | Representation |
---|---|
bin | 111100010010010010111111… |
… | …010001001001101011111101 |
3 | 1021202210011000112120100221001 |
4 | 330102102333101021223331 |
5 | 234223023441243423203 |
6 | 2335523405542010301 |
7 | 106563512410141432 |
oct | 7422227721115375 |
9 | 1252704015510831 |
10 | 265140130061053 |
11 | 77533330259925 |
12 | 258a1b25116991 |
13 | b4c37b7700b00 |
14 | 4968bca709b89 |
15 | 209bd836c691d |
hex | f124bf449afd |
265140130061053 has 6 divisors (see below), whose sum is σ = 287104401190554. Its totient is φ = 244744735440816.
The previous prime is 265140130061039. The next prime is 265140130061057. The reversal of 265140130061053 is 350160031041562.
It can be written as a sum of positive squares in 3 ways, for example, as 6195454530489 + 258944675530564 = 2489067^2 + 16091758^2 .
It is not a de Polignac number, because 265140130061053 - 25 = 265140130061021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (265140130061057) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 784438254450 + ... + 784438254787.
It is an arithmetic number, because the mean of its divisors is an integer number (47850733531759).
Almost surely, 2265140130061053 is an apocalyptic number.
It is an amenable number.
265140130061053 is a deficient number, since it is larger than the sum of its proper divisors (21964271129501).
265140130061053 is a wasteful number, since it uses less digits than its factorization.
265140130061053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1568876509263 (or 1568876509250 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 265140130061053 in words is "two hundred sixty-five trillion, one hundred forty billion, one hundred thirty million, sixty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •