Base | Representation |
---|---|
bin | 111011011110010000101001… |
… | …010000011110111010000100 |
3 | 1021022010021220212020200210202 |
4 | 323132100221100132322010 |
5 | 233240431440312410111 |
6 | 2324144533533310032 |
7 | 106044250503405452 |
oct | 7336205120367204 |
9 | 1238107825220722 |
10 | 261564200513156 |
11 | 76384833252582 |
12 | 25404a89635318 |
13 | b2c4524009298 |
14 | 4883abc2a79d2 |
15 | 2038d423c0b3b |
hex | ede42941ee84 |
261564200513156 has 12 divisors (see below), whose sum is σ = 458230071411420. Its totient is φ = 130641322967040.
The previous prime is 261564200513141. The next prime is 261564200513207. The reversal of 261564200513156 is 651315002465162.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 10028406898756 + 251535793614400 = 3166766^2 + 15859880^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 261564200513156.
It is an unprimeable number.
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, 35194318205 + ... + 35194325636.
It is an arithmetic number, because the mean of its divisors is an integer number (38185839284285).
Almost surely, 2261564200513156 is an apocalyptic number.
It is an amenable number.
261564200513156 is a deficient number, since it is larger than the sum of its proper divisors (196665870898264).
261564200513156 is a wasteful number, since it uses less digits than its factorization.
261564200513156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70388644774 (or 70388644772 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 47.
The spelling of 261564200513156 in words is "two hundred sixty-one trillion, five hundred sixty-four billion, two hundred million, five hundred thirteen thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •