Search a number
-
+
14506948608 = 211323251409
BaseRepresentation
bin11011000001010111…
…00111100000000000
31101110000101100022220
431200223213200000
5214202234323413
610355302131040
71022332012545
oct154053474000
941400340286
1014506948608
116174881229
12298a420a80
1314a2657979
149b895abcc
1559d8c0223
hex360ae7800

14506948608 has 192 divisors, whose sum is σ = 40617158400. Its totient is φ = 4595712000.

The previous prime is 14506948597. The next prime is 14506948627. The reversal of 14506948608 is 80684960541.

It is a tau number, because it is divible by the number of its divisors (192).

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

It is a congruent number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 35469108 + ... + 35469516.

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

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

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

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

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

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

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

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

The spelling of 14506948608 in words is "fourteen billion, five hundred six million, nine hundred forty-eight thousand, six hundred eight".