Base | Representation |
---|---|
bin | 11001010010010100100101… |
… | …00011111010000110000111 |
3 | 21021212210111102000202011021 |
4 | 30221022102203322012013 |
5 | 24242013224002004201 |
6 | 314132344404452011 |
7 | 14466223231160455 |
oct | 1451122243720607 |
9 | 237783442022137 |
10 | 55605105500551 |
11 | 16798aa1484292 |
12 | 62a07853aa007 |
13 | 25047010c1689 |
14 | da34313199d5 |
15 | 66663a544ea1 |
hex | 3292928fa187 |
55605105500551 has 4 divisors (see below), whose sum is σ = 58531690000600. Its totient is φ = 52678521000504.
The previous prime is 55605105500533. The next prime is 55605105500557. The reversal of 55605105500551 is 15500550150655.
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 55605105500551 - 217 = 55605105369479 is a prime.
It is a super-2 number, since 2×556051055005512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55605105500498 and 55605105500507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55605105500557) 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, 1463292249996 + ... + 1463292250033.
It is an arithmetic number, because the mean of its divisors is an integer number (14632922500150).
Almost surely, 255605105500551 is an apocalyptic number.
55605105500551 is a deficient number, since it is larger than the sum of its proper divisors (2926584500049).
55605105500551 is a wasteful number, since it uses less digits than its factorization.
55605105500551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2926584500048.
The product of its (nonzero) digits is 468750, while the sum is 43.
The spelling of 55605105500551 in words is "fifty-five trillion, six hundred five billion, one hundred five million, five hundred thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •