Search a number
-
+
55000110601 = 200327458867
BaseRepresentation
bin110011001110010000…
…110001011000001001
312020222001102002220101
4303032100301120021
51400120012014401
641133335125401
73654645140452
oct631620613011
9166861362811
1055000110601
1121364146167
12a7ab513861
135256939a57
14293a820129
15166d81e101
hexcce431609

55000110601 has 4 divisors (see below), whose sum is σ = 55027571472. Its totient is φ = 54972649732.

The previous prime is 55000110589. The next prime is 55000110617. The reversal of 55000110601 is 10601100055.

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 a de Polignac number, because none of the positive numbers 2k-55000110601 is a prime.

It is a super-2 number, since 2×550001106012 (a number of 22 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (55000110691) 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, 13727431 + ... + 13731436.

It is an arithmetic number, because the mean of its divisors is an integer number (13756892868).

Almost surely, 255000110601 is an apocalyptic number.

It is an amenable number.

55000110601 is a deficient number, since it is larger than the sum of its proper divisors (27460871).

55000110601 is a wasteful number, since it uses less digits than its factorization.

55000110601 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 27460870.

The product of its (nonzero) digits is 150, while the sum is 19.

Adding to 55000110601 its reverse (10601100055), we get a palindrome (65601210656).

The spelling of 55000110601 in words is "fifty-five billion, one hundred ten thousand, six hundred one".

Divisors: 1 2003 27458867 55000110601