Search a number
-
+
1011112002 = 23256172889
BaseRepresentation
bin111100010001000…
…101100001000010
32121110120210220200
4330101011201002
54032321041002
6244155350030
734025211255
oct7421054102
92543523820
101011112002
1147982345a
12242752316
1313162ac34
149840109c
155db78b1c
hex3c445842

1011112002 has 12 divisors (see below), whose sum is σ = 2190742710. Its totient is φ = 337037328.

The previous prime is 1011111991. The next prime is 1011112049. The reversal of 1011112002 is 2002111101.

It is a happy number.

It can be written as a sum of positive squares in only one way, i.e., 957221721 + 53890281 = 30939^2 + 7341^2 .

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

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 5 ways as a sum of consecutive naturals, for example, 28086427 + ... + 28086462.

Almost surely, 21011112002 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 4, while the sum is 9.

The square root of 1011112002 is about 31797.9873891415. The cubic root of 1011112002 is about 1003.6903651192.

Adding to 1011112002 its reverse (2002111101), we get a palindrome (3013223103).

Subtracting 1011112002 from its reverse (2002111101), we obtain a palindrome (990999099).

The spelling of 1011112002 in words is "one billion, eleven million, one hundred twelve thousand, two".

Divisors: 1 2 3 6 9 18 56172889 112345778 168518667 337037334 505556001 1011112002