Base | Representation |
---|---|
bin | 111111110010111010110100… |
… | …1100111011001110100011101 |
3 | 2201120212121202001110122120021 |
4 | 1333211311221213121310131 |
5 | 1042022404032304430331 |
6 | 5305245422003352141 |
7 | 226124622000142654 |
oct | 17745655147316435 |
9 | 2646777661418507 |
10 | 561152134061341 |
11 | 152889313520879 |
12 | 52b2b062382651 |
13 | 1b11655ac42744 |
14 | 9c7dca018219b |
15 | 44d1cc4d3b211 |
hex | 1fe5d699d9d1d |
561152134061341 has 8 divisors (see below), whose sum is σ = 575681735823264. Its totient is φ = 546794480249520.
The previous prime is 561152134061287. The next prime is 561152134061357. The reversal of 561152134061341 is 143160431251165.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 561152134061341 - 219 = 561152133537053 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 (561152134062341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42986980915 + ... + 42986993968.
It is an arithmetic number, because the mean of its divisors is an integer number (71960216977908).
Almost surely, 2561152134061341 is an apocalyptic number.
It is an amenable number.
561152134061341 is a deficient number, since it is larger than the sum of its proper divisors (14529601761923).
561152134061341 is a wasteful number, since it uses less digits than its factorization.
561152134061341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85973975051.
The product of its (nonzero) digits is 259200, while the sum is 43.
The spelling of 561152134061341 in words is "five hundred sixty-one trillion, one hundred fifty-two billion, one hundred thirty-four million, sixty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •