Search a number
-
+
100100022010 = 2523435217487
BaseRepresentation
bin101110100111001101…
…1010001111011111010
3100120101010211222122121
41131032123101323322
53120001101201020
6113552454511454
710142400101602
oct1351633217372
9316333758577
10100100022010
11394a794211a
121749736558a
139593460271
144bb8459c02
15290cde5baa
hex174e6d1efa

100100022010 has 16 divisors (see below), whose sum is σ = 188013954816. Its totient is φ = 38299138768.

The previous prime is 100100022007. The next prime is 100100022017. The reversal of 100100022010 is 10220001001.

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

It is not an unprimeable number, because it can be changed into a prime (100100022017) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 217608514 + ... + 217608973.

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

Almost surely, 2100100022010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 435217517.

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

Adding to 100100022010 its reverse (10220001001), we get a palindrome (110320023011).

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

Divisors: 1 2 5 10 23 46 115 230 435217487 870434974 2176087435 4352174870 10010002201 20020004402 50050011005 100100022010