Base | Representation |
---|---|
bin | 1010010110010101… |
… | …10011011001001011 |
3 | 112100012202122020112 |
4 | 11023022303121023 |
5 | 42334324343233 |
6 | 2315154144535 |
7 | 254453663261 |
oct | 51312633113 |
9 | 15305678215 |
10 | 5556090443 |
11 | 23a12a4a92 |
12 | 10b088214b |
13 | 6a71222a7 |
14 | 3a9c98431 |
15 | 227b9e048 |
hex | 14b2b364b |
5556090443 has 4 divisors (see below), whose sum is σ = 5562942168. Its totient is φ = 5549238720.
The previous prime is 5556090439. The next prime is 5556090481. The reversal of 5556090443 is 3440906555.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5556090443 - 22 = 5556090439 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 5556090443.
It is not an unprimeable number, because it can be changed into a prime (5556090343) 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, 3424646 + ... + 3426267.
It is an arithmetic number, because the mean of its divisors is an integer number (1390735542).
Almost surely, 25556090443 is an apocalyptic number.
5556090443 is a deficient number, since it is larger than the sum of its proper divisors (6851725).
5556090443 is an equidigital number, since it uses as much as digits as its factorization.
5556090443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6851724.
The product of its (nonzero) digits is 324000, while the sum is 41.
The square root of 5556090443 is about 74539.1872976893. The cubic root of 5556090443 is about 1771.1544537529.
Adding to 5556090443 its reverse (3440906555), we get a palindrome (8996996998).
The spelling of 5556090443 in words is "five billion, five hundred fifty-six million, ninety thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •