Search a number
-
+
1095103152 = 2434111319311
BaseRepresentation
bin100000101000101…
…1111001010110000
32211022122000010000
41001101133022300
54220321300102
6300355510000
736065136363
oct10121371260
92738560100
101095103152
11512180230
122668b8300
13145b57b40
14a56260da
156621a01c
hex4145f2b0

1095103152 has 400 divisors, whose sum is σ = 3932248320. Its totient is φ = 289267200.

The previous prime is 1095103151. The next prime is 1095103187. The reversal of 1095103152 is 2513015901.

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

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

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

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 3521077 + ... + 3521387.

Almost surely, 21095103152 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 27.

The square root of 1095103152 is about 33092.3428001101. The cubic root of 1095103152 is about 1030.7460432184.

The spelling of 1095103152 in words is "one billion, ninety-five million, one hundred three thousand, one hundred fifty-two".