Base | Representation |
---|---|
bin | 11111010111001001001… |
… | …101000100100001101101 |
3 | 21122000211101222000020212 |
4 | 133113021031010201231 |
5 | 240302223442342000 |
6 | 4330021511152205 |
7 | 311463505654424 |
oct | 37271115044155 |
9 | 7560741860225 |
10 | 2155154262125 |
11 | 760aa543a3a7 |
12 | 2a9824975665 |
13 | 1282cb904277 |
14 | 7644a9ba2bb |
15 | 3b0d9335c35 |
hex | 1f5c934486d |
2155154262125 has 64 divisors (see below), whose sum is σ = 2902845097152. Its totient is φ = 1591612416000.
The previous prime is 2155154262113. The next prime is 2155154262139. The reversal of 2155154262125 is 5212624515512.
It can be written as a sum of positive squares in 32 ways, for example, as 2006715895396 + 148438366729 = 1416586^2 + 385277^2 .
It is not a de Polignac number, because 2155154262125 - 212 = 2155154258029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 28039247 + ... + 28116003.
It is an arithmetic number, because the mean of its divisors is an integer number (45356954643).
Almost surely, 22155154262125 is an apocalyptic number.
2155154262125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2155154262125 is a deficient number, since it is larger than the sum of its proper divisors (747690835027).
2155154262125 is a wasteful number, since it uses less digits than its factorization.
2155154262125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77043 (or 77033 counting only the distinct ones).
The product of its digits is 240000, while the sum is 41.
Adding to 2155154262125 its reverse (5212624515512), we get a palindrome (7367778777637).
The spelling of 2155154262125 in words is "two trillion, one hundred fifty-five billion, one hundred fifty-four million, two hundred sixty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •