Base | Representation |
---|---|
bin | 111011011100100000111000… |
… | …011100001001010101010110 |
3 | 1021021200211011112212010121010 |
4 | 323130200320130021111112 |
5 | 233232000203203110340 |
6 | 2324013450003233050 |
7 | 106032501622166403 |
oct | 7334407034112526 |
9 | 1237624145763533 |
10 | 261444196144470 |
11 | 76338951984179 |
12 | 253a5778378786 |
13 | b2b610ac525c1 |
14 | 487bd765452aa |
15 | 2035b6bd55b80 |
hex | edc838709556 |
261444196144470 has 128 divisors (see below), whose sum is σ = 661543649712000. Its totient is φ = 66036437913600.
The previous prime is 261444196144457. The next prime is 261444196144541. The reversal of 261444196144470 is 74441691444162.
It is a super-2 number, since 2×2614441961444702 (a number of 30 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 261444196144470.
It is a congruent number.
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 63 ways as a sum of consecutive naturals, for example, 4070575 + ... + 23226234.
It is an arithmetic number, because the mean of its divisors is an integer number (5168309763375).
Almost surely, 2261444196144470 is an apocalyptic number.
261444196144470 is an abundant number, since it is smaller than the sum of its proper divisors (400099453567530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
261444196144470 is a wasteful number, since it uses less digits than its factorization.
261444196144470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27297058.
The product of its (nonzero) digits is 18579456, while the sum is 57.
The spelling of 261444196144470 in words is "two hundred sixty-one trillion, four hundred forty-four billion, one hundred ninety-six million, one hundred forty-four thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •