Search a number
-
+
10659893952 = 26355520281
BaseRepresentation
bin10011110110110000…
…10001001011000000
31000111220110201110010
421323120101023000
5133312413101302
64521434304520
7525106414011
oct117330211300
930456421403
1010659893952
114580261114
122095b88140
13100b626976
14731a5b008
15425cac16c
hex27b6112c0

10659893952 has 28 divisors (see below), whose sum is σ = 28204303256. Its totient is φ = 3553297920.

The previous prime is 10659893879. The next prime is 10659893953. The reversal of 10659893952 is 25939895601.

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

It is a junction number, because it is equal to n+sod(n) for n = 10659893892 and 10659893901.

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

Almost surely, 210659893952 is an apocalyptic number.

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

It is an amenable number.

10659893952 is an abundant number, since it is smaller than the sum of its proper divisors (17544409304).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

10659893952 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 55520296 (or 55520286 counting only the distinct ones).

The product of its (nonzero) digits is 5248800, while the sum is 57.

The spelling of 10659893952 in words is "ten billion, six hundred fifty-nine million, eight hundred ninety-three thousand, nine hundred fifty-two".

Divisors: 1 2 3 4 6 8 12 16 24 32 48 64 96 192 55520281 111040562 166560843 222081124 333121686 444162248 666243372 888324496 1332486744 1776648992 2664973488 3553297984 5329946976 10659893952