Base | Representation |
---|---|
bin | 111001010101010010… |
… | …010011011110101001 |
3 | 12212220020202112110120 |
4 | 321111102103132221 |
5 | 2002033430411011 |
6 | 44140325033453 |
7 | 4306344541104 |
oct | 712522233651 |
9 | 185806675416 |
10 | 61560403881 |
11 | 24120274649 |
12 | bb20555889 |
13 | 5a60b0b1b2 |
14 | 2d9dbdb73b |
15 | 190472ea06 |
hex | e554937a9 |
61560403881 has 8 divisors (see below), whose sum is σ = 82090616544. Its totient is φ = 41035230240.
The previous prime is 61560403843. The next prime is 61560403939. The reversal of 61560403881 is 18830406516.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 61560403881 - 27 = 61560403753 is a prime.
It is a super-2 number, since 2×615604038812 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (61560404881) 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 7 ways as a sum of consecutive naturals, for example, 1231156 + ... + 1280181.
It is an arithmetic number, because the mean of its divisors is an integer number (10261327068).
Almost surely, 261560403881 is an apocalyptic number.
It is an amenable number.
61560403881 is a deficient number, since it is larger than the sum of its proper divisors (20530212663).
61560403881 is a wasteful number, since it uses less digits than its factorization.
61560403881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2519511.
The product of its (nonzero) digits is 138240, while the sum is 42.
The spelling of 61560403881 in words is "sixty-one billion, five hundred sixty million, four hundred three thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •