Base | Representation |
---|---|
bin | 1010010110110110… |
… | …01101100011001001 |
3 | 112100111212011201001 |
4 | 11023123031203021 |
5 | 42341430020011 |
6 | 2315430255001 |
7 | 254535360022 |
oct | 51333154311 |
9 | 15314764631 |
10 | 5560391881 |
11 | 23a37727a0 |
12 | 10b21b7461 |
13 | 6a7c9a115 |
14 | 3aa697c49 |
15 | 22824d7c1 |
hex | 14b6cd8c9 |
5560391881 has 4 divisors (see below), whose sum is σ = 6065882064. Its totient is φ = 5054901700.
The previous prime is 5560391869. The next prime is 5560391899. The reversal of 5560391881 is 1881930655.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5560391881 - 227 = 5426174153 is a prime.
It is a super-2 number, since 2×55603918812 = 61835915740581436322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5560391981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 252745075 + ... + 252745096.
It is an arithmetic number, because the mean of its divisors is an integer number (1516470516).
Almost surely, 25560391881 is an apocalyptic number.
It is an amenable number.
5560391881 is a deficient number, since it is larger than the sum of its proper divisors (505490183).
5560391881 is a wasteful number, since it uses less digits than its factorization.
5560391881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505490182.
The product of its (nonzero) digits is 259200, while the sum is 46.
The square root of 5560391881 is about 74568.0352496966. The cubic root of 5560391881 is about 1771.6114025103.
The spelling of 5560391881 in words is "five billion, five hundred sixty million, three hundred ninety-one thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •