Search a number
-
+
101000022010 = 2510100002201
BaseRepresentation
bin101111000010000010…
…0100000011111111010
3100122200212100201112221
41132010010200133322
53123322001201020
6114222044554254
710203606010366
oct1360404403772
9318625321487
10101000022010
1139919974478
12176a885298a
1396a7a56944
144c61bb62a6
152961e226aa
hex17841207fa

101000022010 has 8 divisors (see below), whose sum is σ = 181800039636. Its totient is φ = 40400008800.

The previous prime is 101000021977. The next prime is 101000022023. The reversal of 101000022010 is 10220000101.

It can be written as a sum of positive squares in 2 ways, for example, as 100813235121 + 186786889 = 317511^2 + 13667^2 .

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

It is a junction number, because it is equal to n+sod(n) for n = 101000021984 and 101000022002.

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

Almost surely, 2101000022010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10100002208.

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

Adding to 101000022010 its reverse (10220000101), we get a palindrome (111220022111).

The spelling of 101000022010 in words is "one hundred one billion, twenty-two thousand, ten".

Divisors: 1 2 5 10 10100002201 20200004402 50500011005 101000022010