Search a number
-
+
16399405932 = 223713198389107
BaseRepresentation
bin11110100010111101…
…10001001101101100
31120022220101010201220
433101132301031230
5232041221442212
611311144103340
71120251436050
oct172136611554
946286333656
1016399405932
116a56045448
123218164b50
13171474a2c0
14b1801dc60
1565eadd38c
hex3d17b136c

16399405932 has 384 divisors, whose sum is σ = 51209625600. Its totient is φ = 3965220864.

The previous prime is 16399405921. The next prime is 16399405949. The reversal of 16399405932 is 23950499361.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 153265423 + ... + 153265529.

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

Almost surely, 216399405932 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 16399405932 in words is "sixteen billion, three hundred ninety-nine million, four hundred five thousand, nine hundred thirty-two".