Search a number
-
+
10002011270 = 251000201127
BaseRepresentation
bin10010101000010101…
…01001010010000110
3221211001112211001212
421110022221102012
5130441003330040
64332253451422
7502600456466
oct112412512206
927731484055
1010002011270
114272969119
121b317a0b72
13c35242a84
146ac527ba6
153d8158d65
hex2542a9486

10002011270 has 8 divisors (see below), whose sum is σ = 18003620304. Its totient is φ = 4000804504.

The previous prime is 10002011263. The next prime is 10002011281. The reversal of 10002011270 is 7211020001.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 500100554 + ... + 500100573.

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

Almost surely, 210002011270 is an apocalyptic number.

10002011270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

10002011270 is a deficient number, since it is larger than the sum of its proper divisors (8001609034).

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

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

The sum of its prime factors is 1000201134.

The product of its (nonzero) digits is 28, while the sum is 14.

Adding to 10002011270 its reverse (7211020001), we get a palindrome (17213031271).

The spelling of 10002011270 in words is "ten billion, two million, eleven thousand, two hundred seventy".

Divisors: 1 2 5 10 1000201127 2000402254 5001005635 10002011270