Base | Representation |
---|---|
bin | 110011110110011110… |
… | …111010001101110101 |
3 | 12022201002011020102121 |
4 | 303312132322031311 |
5 | 1403010233433321 |
6 | 41324322235541 |
7 | 4010450613430 |
oct | 636636721565 |
9 | 168632136377 |
10 | 55674905461 |
11 | 2168003a56a |
12 | a9594b5bb1 |
13 | 5333692756 |
14 | 29a22b6817 |
15 | 16acbb3441 |
hex | cf67ba375 |
55674905461 has 4 divisors (see below), whose sum is σ = 63628463392. Its totient is φ = 47721347532.
The previous prime is 55674905453. The next prime is 55674905467. The reversal of 55674905461 is 16450947655.
It is a happy number.
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 55674905461 - 23 = 55674905453 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55674905399 and 55674905408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55674905467) 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, 3976778955 + ... + 3976778968.
It is an arithmetic number, because the mean of its divisors is an integer number (15907115848).
Almost surely, 255674905461 is an apocalyptic number.
It is an amenable number.
55674905461 is a deficient number, since it is larger than the sum of its proper divisors (7953557931).
55674905461 is an equidigital number, since it uses as much as digits as its factorization.
55674905461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7953557930.
The product of its (nonzero) digits is 4536000, while the sum is 52.
The spelling of 55674905461 in words is "fifty-five billion, six hundred seventy-four million, nine hundred five thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •