Search a number
-
+
101451161664 = 2633177094871
BaseRepresentation
bin101111001111011110…
…1011110000001000000
3100200212022020222211000
41132132331132001000
53130232444133124
6114334522252000
710221024434346
oct1363675360100
9320768228730
10101451161664
113a030599366
12177b3957000
13974a362298
144ca5a8d996
15298b8386c9
hex179ef5e040

101451161664 has 224 divisors, whose sum is σ = 316301932800. Its totient is φ = 31776399360.

The previous prime is 101451161641. The next prime is 101451161729. The reversal of 101451161664 is 466161154101.

101451161664 is a `hidden beast` number, since 10 + 14 + 5 + 11 + 616 + 6 + 4 = 666.

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

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 31 ways as a sum of consecutive naturals, for example, 20825149 + ... + 20830019.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 17280, while the sum is 36.

The spelling of 101451161664 in words is "one hundred one billion, four hundred fifty-one million, one hundred sixty-one thousand, six hundred sixty-four".