Search a number
-
+
99012609696 = 2537211131961127
BaseRepresentation
bin101110000110110011…
…1001000011010100000
3100110120100200201101110
41130031213020122200
53110234212002241
6113252531503320
710103424203400
oct1341547103240
9313510621343
1099012609696
1138a9a045160
1217233157b40
13944c098c20
144b13c76800
1528976e9816
hex170d9c86a0

99012609696 has 1152 divisors, whose sum is σ = 383015485440. Its totient is φ = 21946982400.

The previous prime is 99012609653. The next prime is 99012609701. The reversal of 99012609696 is 69690621099.

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

It is an unprimeable number.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 779626785 + ... + 779626911.

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

Almost surely, 299012609696 is an apocalyptic number.

99012609696 is a gapful number since it is divisible by the number (96) 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 99012609696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (191507742720).

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

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

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

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

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

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

The spelling of 99012609696 in words is "ninety-nine billion, twelve million, six hundred nine thousand, six hundred ninety-six".