Search a number
32161393960 = 2356431250443
BaseRepresentation
bin11101111100111101…
…111110110100101000
310002000101100002111021
4131330331332310220
51011331304101320
622435202142224
72215663223653
oct357475766450
9102011302437
1032161393960
11127042a5333
126296951974
1330570ca537
1417b151689a
15c8376bdaa
hex77cf7ed28

32161393960 has 32 divisors (see below), whose sum is σ = 72475734240. Its totient is φ = 12844540224.

The previous prime is 32161393937. The next prime is 32161393961. The reversal of 32161393960 is 6939316123.

It is a super-2 number, since 2×321613939602 (a number of 22 digits) contains 22 as substring.

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

It is not an unprimeable number, because it can be changed into a prime (32161393961) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 599502 + ... + 650941.

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

Almost surely, 232161393960 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 157464, while the sum is 43.

The spelling of 32161393960 in words is "thirty-two billion, one hundred sixty-one million, three hundred ninety-three thousand, nine hundred sixty".