Base | Representation |
---|---|
bin | 10000001011101110111… |
… | …11011010110010110101 |
3 | 1222011021110112110121010 |
4 | 20011313133122302311 |
5 | 33102300202143401 |
6 | 1103240503142433 |
7 | 55113400550004 |
oct | 10056737326265 |
9 | 1864243473533 |
10 | 556055506101 |
11 | 1a4904922947 |
12 | 8b925a44a19 |
13 | 4058861bbb4 |
14 | 1ccadc90c3b |
15 | e6e6e26ed6 |
hex | 81777dacb5 |
556055506101 has 4 divisors (see below), whose sum is σ = 741407341472. Its totient is φ = 370703670732.
The previous prime is 556055506091. The next prime is 556055506103. The reversal of 556055506101 is 101605550655.
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 not a de Polignac number, because 556055506101 - 230 = 554981764277 is a prime.
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 556055506101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556055506103) by changing a digit.
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, 92675917681 + ... + 92675917686.
It is an arithmetic number, because the mean of its divisors is an integer number (185351835368).
Almost surely, 2556055506101 is an apocalyptic number.
It is an amenable number.
556055506101 is a deficient number, since it is larger than the sum of its proper divisors (185351835371).
556055506101 is a wasteful number, since it uses less digits than its factorization.
556055506101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185351835370.
The product of its (nonzero) digits is 112500, while the sum is 39.
The spelling of 556055506101 in words is "five hundred fifty-six billion, fifty-five million, five hundred six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •