Base | Representation |
---|---|
bin | 101000100110101100010… |
… | …1100011011110101010111 |
3 | 201202111122010120211101011 |
4 | 1101031120230123311113 |
5 | 1212413133020421410 |
6 | 15511414313113051 |
7 | 1114121503044136 |
oct | 121153054336527 |
9 | 21674563524334 |
10 | 5580650560855 |
11 | 1861816833037 |
12 | 7616986b8787 |
13 | 31633a0661a6 |
14 | 154167ccd91d |
15 | 9a2739cc18a |
hex | 51358b1bd57 |
5580650560855 has 4 divisors (see below), whose sum is σ = 6696780673032. Its totient is φ = 4464520448680.
The previous prime is 5580650560841. The next prime is 5580650560871.
5580650560855 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5580650560855 - 213 = 5580650552663 is a prime.
It is a super-2 number, since 2×55806505608552 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5580650560855.
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 3 ways as a sum of consecutive naturals, for example, 558065056081 + ... + 558065056090.
It is an arithmetic number, because the mean of its divisors is an integer number (1674195168258).
Almost surely, 25580650560855 is an apocalyptic number.
5580650560855 is a deficient number, since it is larger than the sum of its proper divisors (1116130112177).
5580650560855 is a wasteful number, since it uses less digits than its factorization.
5580650560855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1116130112176.
The product of its (nonzero) digits is 36000000, while the sum is 58.
The spelling of 5580650560855 in words is "five trillion, five hundred eighty billion, six hundred fifty million, five hundred sixty thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •