Search a number
-
+
15640546152 = 23371124611669
BaseRepresentation
bin11101001000011111…
…11100101101101000
31111101000110001211010
432210033330231220
5224012434434102
611103555103520
71062405306630
oct164417745550
944330401733
1015640546152
1166a6753900
123045ba1ba0
13162346cc4a
14a853236c0
15618190d6c
hex3a43fcb68

15640546152 has 192 divisors, whose sum is σ = 49255113600. Its totient is φ = 4051238400.

The previous prime is 15640546139. The next prime is 15640546199. The reversal of 15640546152 is 25164504651.

It is a self number, because there is not a number n which added to its sum of digits gives 15640546152.

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 47 ways as a sum of consecutive naturals, for example, 9370374 + ... + 9372042.

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

Almost surely, 215640546152 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 144000, while the sum is 39.

The spelling of 15640546152 in words is "fifteen billion, six hundred forty million, five hundred forty-six thousand, one hundred fifty-two".