Search a number
-
+
10001012202 = 2321429338873
BaseRepresentation
bin10010101000001101…
…10101010111101010
3221210222200001121100
421110012311113222
5130440224342302
64332220222230
7502556125656
oct112406652752
927728601540
1010001012202
114272346545
121b3139a976
13c34c830cc
146ac347a66
153d800cd1c
hex2541b55ea

10001012202 has 24 divisors (see below), whose sum is σ = 21670933284. Its totient is φ = 3333351744.

The previous prime is 10001012183. The next prime is 10001012233. The reversal of 10001012202 is 20221010001.

10001012202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 2 ways, for example, as 9999800001 + 1212201 = 99999^2 + 1101^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 (17) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 237838 + ... + 276710.

Almost surely, 210001012202 is an apocalyptic number.

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

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

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

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

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

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

Adding to 10001012202 its reverse (20221010001), we get a palindrome (30222022203).

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

Divisors: 1 2 3 6 9 18 14293 28586 38873 42879 77746 85758 116619 128637 233238 257274 349857 699714 555611789 1111223578 1666835367 3333670734 5000506101 10001012202