Base | Representation |
---|---|
bin | 1001011010101011… |
… | …00111110011001101 |
3 | 111001100000121020002 |
4 | 10231111213303031 |
5 | 40323214010221 |
6 | 2153355134045 |
7 | 236165655635 |
oct | 45525476315 |
9 | 14040017202 |
10 | 5055610061 |
11 | 216483a737 |
12 | b91144325 |
13 | 62752c658 |
14 | 35d6196c5 |
15 | 1e8c8d80b |
hex | 12d567ccd |
5055610061 has 4 divisors (see below), whose sum is σ = 5173182432. Its totient is φ = 4938037692.
The previous prime is 5055610051. The next prime is 5055610067. The reversal of 5055610061 is 1600165505.
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 5055610061 - 26 = 5055609997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5055610067) 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 3 ways as a sum of consecutive naturals, for example, 58786121 + ... + 58786206.
It is an arithmetic number, because the mean of its divisors is an integer number (1293295608).
Almost surely, 25055610061 is an apocalyptic number.
It is an amenable number.
5055610061 is a deficient number, since it is larger than the sum of its proper divisors (117572371).
5055610061 is a wasteful number, since it uses less digits than its factorization.
5055610061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117572370.
The product of its (nonzero) digits is 4500, while the sum is 29.
The square root of 5055610061 is about 71102.8133128359. The cubic root of 5055610061 is about 1716.2920460995.
Adding to 5055610061 its reverse (1600165505), we get a palindrome (6655775566).
The spelling of 5055610061 in words is "five billion, fifty-five million, six hundred ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •