Base | Representation |
---|---|
bin | 111111110101110000110110… |
… | …0011111000100011001110010 |
3 | 2201122020222200212021202002020 |
4 | 1333223201230133010121302 |
5 | 1042100310103200411200 |
6 | 5310145145400332310 |
7 | 226165100423601630 |
oct | 17753415437043162 |
9 | 2648228625252066 |
10 | 561543024232050 |
11 | 152a1a071867633 |
12 | 52b92972774096 |
13 | 1b144384128043 |
14 | 9c94b82500350 |
15 | 44dc051ab0ea0 |
hex | 1feb86c7c4672 |
561543024232050 has 48 divisors (see below), whose sum is σ = 1591573371540672. Its totient is φ = 128352691252800.
The previous prime is 561543024232049. The next prime is 561543024232121. The reversal of 561543024232050 is 50232420345165.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 561543024231993 and 561543024232011.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 267401439061 + ... + 267401441160.
It is an arithmetic number, because the mean of its divisors is an integer number (33157778573764).
Almost surely, 2561543024232050 is an apocalyptic number.
561543024232050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
561543024232050 is an abundant number, since it is smaller than the sum of its proper divisors (1030030347308622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561543024232050 is a wasteful number, since it uses less digits than its factorization.
561543024232050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 534802880243 (or 534802880238 counting only the distinct ones).
The product of its (nonzero) digits is 864000, while the sum is 42.
The spelling of 561543024232050 in words is "five hundred sixty-one trillion, five hundred forty-three billion, twenty-four million, two hundred thirty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •