Search a number
-
+
86446546272 = 25377316921
BaseRepresentation
bin101000010000010011…
…1011001110101100000
322021010121102120000000
41100200213121311200
52404020303440042
6103414001300000
76150140343102
oct1204047316540
9267117376000
1086446546272
1133730904779
1214906934600
1381c888b538
144280dc7572
1523ae41174c
hex14209d9d60

86446546272 has 192 divisors, whose sum is σ = 258760393920. Its totient is φ = 28419102720.

The previous prime is 86446546267. The next prime is 86446546279. The reversal of 86446546272 is 27264564468.

It is a happy number.

86446546272 is a `hidden beast` number, since 8 + 6 + 4 + 4 + 6 + 5 + 4 + 627 + 2 = 666.

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

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5100372 + ... + 5117292.

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

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

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

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

86446546272 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its digits is 15482880, while the sum is 54.

The spelling of 86446546272 in words is "eighty-six billion, four hundred forty-six million, five hundred forty-six thousand, two hundred seventy-two".