Base | Representation |
---|---|
bin | 10000001011110010101… |
… | …11010111100000111101 |
3 | 1222011100122200222110002 |
4 | 20011321113113200331 |
5 | 33102331224344244 |
6 | 1103243545124045 |
7 | 55114232041016 |
oct | 10057127274075 |
9 | 1864318628402 |
10 | 556086949949 |
11 | 1a492064a0a3 |
12 | 8b934489625 |
13 | 40591cab11b |
14 | 1ccb411800d |
15 | e6e9a88a4e |
hex | 81795d783d |
556086949949 has 4 divisors (see below), whose sum is σ = 556459414236. Its totient is φ = 555714485664.
The previous prime is 556086949939. The next prime is 556086949987. The reversal of 556086949949 is 949949680655.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 253933350724 + 302153599225 = 503918^2 + 549685^2 .
It is a cyclic number.
It is not a de Polignac number, because 556086949949 - 212 = 556086945853 is a prime.
It is a super-2 number, since 2×5560869499492 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556086949939) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 186229904 + ... + 186232889.
It is an arithmetic number, because the mean of its divisors is an integer number (139114853559).
Almost surely, 2556086949949 is an apocalyptic number.
It is an amenable number.
556086949949 is a deficient number, since it is larger than the sum of its proper divisors (372464287).
556086949949 is a wasteful number, since it uses less digits than its factorization.
556086949949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372464286.
The product of its (nonzero) digits is 755827200, while the sum is 74.
The spelling of 556086949949 in words is "five hundred fifty-six billion, eighty-six million, nine hundred forty-nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.221 sec. • engine limits •