Search a number
-
+
11020012002 = 232612222889
BaseRepresentation
bin10100100001101100…
…00000100111100010
31001110000002121112200
422100312000213202
5140032110341002
65021301034030
7540041361606
oct122066004742
931400077480
1011020012002
11474556713a
1221766b5916
13106811337c
147677dd506
154476e3b1c
hex290d809e2

11020012002 has 12 divisors (see below), whose sum is σ = 23876692710. Its totient is φ = 3673337328.

The previous prime is 11020011971. The next prime is 11020012009. The reversal of 11020012002 is 20021002011.

It can be written as a sum of positive squares in only one way, i.e., 10778800041 + 241211961 = 103821^2 + 15531^2 .

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

It is not an unprimeable number, because it can be changed into a prime (11020012009) 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 5 ways as a sum of consecutive naturals, for example, 306111427 + ... + 306111462.

Almost surely, 211020012002 is an apocalyptic number.

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

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

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

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

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

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

Adding to 11020012002 its reverse (20021002011), we get a palindrome (31041014013).

Subtracting 11020012002 from its reverse (20021002011), we obtain a palindrome (9000990009).

The spelling of 11020012002 in words is "eleven billion, twenty million, twelve thousand, two".

Divisors: 1 2 3 6 9 18 612222889 1224445778 1836668667 3673337334 5510006001 11020012002