Search a number
-
+
13695610992 = 2437172922851
BaseRepresentation
bin11001100000101001…
…00111000001110000
31022100110201010100120
430300110213001300
5211022034022432
610143000250240
7663250526010
oct146024470160
938313633316
1013695610992
1158988a7278
1227a2770980
1313a353543b
1493ccbdc40
15552558c2c
hex330527070

13695610992 has 240 divisors, whose sum is σ = 44355946752. Its totient is φ = 3554611200.

The previous prime is 13695610969. The next prime is 13695610997. The reversal of 13695610992 is 29901659631.

It is a Harshad number since it is a multiple of its sum of digits (51).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (13695610997) 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 47 ways as a sum of consecutive naturals, for example, 4802367 + ... + 4805217.

Almost surely, 213695610992 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 13695610992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22177973376).

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

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

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

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

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

The product of its (nonzero) digits is 787320, while the sum is 51.

The spelling of 13695610992 in words is "thirteen billion, six hundred ninety-five million, six hundred ten thousand, nine hundred ninety-two".