Search a number
-
+
1091265256704 = 28371935232011
BaseRepresentation
bin11111110000101000111…
…10100101110100000000
310212022202011002211111210
433320110132211310000
5120334402401203304
62153153105410120
7141561366430440
oct17702436456400
93768664084453
101091265256704
11390891874087
121575b2639940
137bba127cb0c
143ab633c0120
151d5bdc1dc89
hexfe147a5d00

1091265256704 has 288 divisors, whose sum is σ = 3344505170944. Its totient is φ = 309427568640.

The previous prime is 1091265256687. The next prime is 1091265256729. The reversal of 1091265256704 is 4076525621901.

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

It is a congruent number.

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, 542647059 + ... + 542649069.

Almost surely, 21091265256704 is an apocalyptic number.

1091265256704 is a gapful number since it is divisible by the number (14) 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 1091265256704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1672252585472).

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

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

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

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

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

The product of its (nonzero) digits is 907200, while the sum is 48.

The spelling of 1091265256704 in words is "one trillion, ninety-one billion, two hundred sixty-five million, two hundred fifty-six thousand, seven hundred four".