Base | Representation |
---|---|
bin | 1111001110010000111… |
… | …0100010111100000011 |
3 | 221000001021021222110010 |
4 | 3303210032202330003 |
5 | 13241101411244011 |
6 | 320051024240003 |
7 | 24615612204255 |
oct | 3634416427403 |
9 | 830037258403 |
10 | 261527056131 |
11 | a0a05229120 |
12 | 42828a70003 |
13 | 1b87b252673 |
14 | c92d6bbcd5 |
15 | 6c09cb81a6 |
hex | 3ce43a2f03 |
261527056131 has 32 divisors (see below), whose sum is σ = 384188163840. Its totient is φ = 156931891200.
The previous prime is 261527056127. The next prime is 261527056159. The reversal of 261527056131 is 131650725162.
261527056131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 261527056131 - 22 = 261527056127 is a prime.
It is a super-2 number, since 2×2615270561312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 261527056131.
It is not an unprimeable number, because it can be changed into a prime (261527051131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1246555 + ... + 1441163.
It is an arithmetic number, because the mean of its divisors is an integer number (12005880120).
Almost surely, 2261527056131 is an apocalyptic number.
261527056131 is a deficient number, since it is larger than the sum of its proper divisors (122661107709).
261527056131 is a wasteful number, since it uses less digits than its factorization.
261527056131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195027.
The product of its (nonzero) digits is 75600, while the sum is 39.
The spelling of 261527056131 in words is "two hundred sixty-one billion, five hundred twenty-seven million, fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •