Search a number
-
+
10661515213 = 37928130647
BaseRepresentation
bin10011110110111100…
…11100111111001101
31000112000112002101211
421323132130333031
5133313321441323
64521533134421
7525126245506
oct117336347715
930460462354
1010661515213
1145811691a8
12209662a411
13100ba738ab
14731d5dbad
15425ecc70d
hex27b79cfcd

10661515213 has 4 divisors (see below), whose sum is σ = 10689646240. Its totient is φ = 10633384188.

The previous prime is 10661515171. The next prime is 10661515217. The reversal of 10661515213 is 31251516601.

It is a happy number.

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 10661515213 - 217 = 10661384141 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 210661515213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 28131026.

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

The spelling of 10661515213 in words is "ten billion, six hundred sixty-one million, five hundred fifteen thousand, two hundred thirteen".

Divisors: 1 379 28130647 10661515213