Search a number
-
+
99062581968 = 243271743233577
BaseRepresentation
bin101110001000010010…
…1110000101011010000
3100110200211201120110100
41130100211300223100
53110340010110333
6113301514532400
710104602024220
oct1342045605320
9313624646410
1099062581968
1139015277059
1217247a37100
13945954480c
144b1a764080
15289bcbb213
hex1710970ad0

99062581968 has 480 divisors, whose sum is σ = 345353538816. Its totient is φ = 25862602752.

The previous prime is 99062581927. The next prime is 99062582029. The reversal of 99062581968 is 86918526099.

It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 171685296 + ... + 171685872.

Almost surely, 299062581968 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 16796160, while the sum is 63.

The spelling of 99062581968 in words is "ninety-nine billion, sixty-two million, five hundred eighty-one thousand, nine hundred sixty-eight".