Search a number
-
+
10606614601 = 11964237691
BaseRepresentation
bin10011110000011010…
…00001100001001001
31000101012012211220211
421320031001201021
5133210243131401
64512252321121
7523561510432
oct117015014111
930335184824
1010606614601
1145531805a0
1220801731a1
131000590a1b
1472894c489
15421285951
hex278341849

10606614601 has 4 divisors (see below), whose sum is σ = 11570852304. Its totient is φ = 9642376900.

The previous prime is 10606614593. The next prime is 10606614607. The reversal of 10606614601 is 10641660601.

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 10606614601 - 23 = 10606614593 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (10606614607) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 482118835 + ... + 482118856.

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

Almost surely, 210606614601 is an apocalyptic number.

10606614601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

10606614601 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 964237702.

The product of its (nonzero) digits is 5184, while the sum is 31.

The spelling of 10606614601 in words is "ten billion, six hundred six million, six hundred fourteen thousand, six hundred one".

Divisors: 1 11 964237691 10606614601