Search a number
-
+
1020011552 = 2574553623
BaseRepresentation
bin111100110011000…
…010010000100000
32122002022221210122
4330303002100200
54042110332202
6245114215412
734163645420
oct7463022040
92562287718
101020011552
1148385185a
12245724568
13133425941
149967a480
155e8359a2
hex3ccc2420

1020011552 has 24 divisors (see below), whose sum is σ = 2295026496. Its totient is φ = 437147712.

The previous prime is 1020011537. The next prime is 1020011579. The reversal of 1020011552 is 2551100201.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2276588 + ... + 2277035.

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

Almost surely, 21020011552 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 100, while the sum is 17.

The square root of 1020011552 is about 31937.6196984058. The cubic root of 1020011552 is about 1006.6265097110.

Adding to 1020011552 its reverse (2551100201), we get a palindrome (3571111753).

The spelling of 1020011552 in words is "one billion, twenty million, eleven thousand, five hundred fifty-two".

Divisors: 1 2 4 7 8 14 16 28 32 56 112 224 4553623 9107246 18214492 31875361 36428984 63750722 72857968 127501444 145715936 255002888 510005776 1020011552