Search a number
-
+
69681101952 = 27371141229251
BaseRepresentation
bin100000011100101010…
…0010011110010000000
320122212012021201222210
41000321110103302000
52120201330230302
652002215502120
75014522410510
oct1007124236200
9218765251883
1069681101952
1127608190270
1211608087940
136756360b97
143530523840
151c2c61c66c
hex1039513c80

69681101952 has 512 divisors, whose sum is σ = 238368614400. Its totient is φ = 17510400000.

The previous prime is 69681101929. The next prime is 69681101957. The reversal of 69681101952 is 25910118696.

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

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

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

Almost surely, 269681101952 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 69681101952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119184307200).

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

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

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

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

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

The product of its (nonzero) digits is 233280, while the sum is 48.

The spelling of 69681101952 in words is "sixty-nine billion, six hundred eighty-one million, one hundred one thousand, nine hundred fifty-two".