Base | Representation |
---|---|
bin | 1010011100001011… |
… | …10001111110001111 |
3 | 112110121222212022220 |
4 | 11032011301332033 |
5 | 42434401334201 |
6 | 2324104510423 |
7 | 255620416413 |
oct | 51605617617 |
9 | 15417885286 |
10 | 5605105551 |
11 | 2416a32841 |
12 | 110517b413 |
13 | 6b4324306 |
14 | 3b25b6d43 |
15 | 22c132036 |
hex | 14e171f8f |
5605105551 has 16 divisors (see below), whose sum is σ = 7632817920. Its totient is φ = 3657609920.
The previous prime is 5605105511. The next prime is 5605105591. The reversal of 5605105551 is 1555015065.
It is an interprime number because it is at equal distance from previous prime (5605105511) and next prime (5605105591).
It is a cyclic number.
It is not a de Polignac number, because 5605105551 - 26 = 5605105487 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5605105501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26715 + ... + 109196.
It is an arithmetic number, because the mean of its divisors is an integer number (477051120).
Almost surely, 25605105551 is an apocalyptic number.
5605105551 is a deficient number, since it is larger than the sum of its proper divisors (2027712369).
5605105551 is a wasteful number, since it uses less digits than its factorization.
5605105551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136206.
The product of its (nonzero) digits is 18750, while the sum is 33.
The square root of 5605105551 is about 74867.2528613145. The cubic root of 5605105551 is about 1776.3475108902.
It can be divided in two parts, 5605 and 105551, that added together give a triangular number (111156 = T471).
The spelling of 5605105551 in words is "five billion, six hundred five million, one hundred five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •