Search a number
-
+
100110011010002 = 2767106727090629
BaseRepresentation
bin10110110000110010101101…
…101001010000101111010010
3111010110102102210102212112122
4112300302231221100233102
5101110200300304310002
6552525523144254242
730041465253246650
oct2660625551205722
9433412383385478
10100110011010002
1129997465397264
12b289ba8171382
1343b24449c9336
141aa14c965ddd0
15b8915783e6a2
hex5b0cada50bd2

100110011010002 has 16 divisors (see below), whose sum is σ = 174178611908160. Its totient is φ = 42263927888688.

The previous prime is 100110011009989. The next prime is 100110011010007. The reversal of 100110011010002 is 200010110011001.

It is a happy number.

It is not an unprimeable number, because it can be changed into a prime (100110011010007) 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, 53363544377 + ... + 53363546252.

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

Almost surely, 2100110011010002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 106727090705.

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

Adding to 100110011010002 its reverse (200010110011001), we get a palindrome (300120121021003).

Subtracting 100110011010002 from its reverse (200010110011001), we obtain a palindrome (99900099000999).

The spelling of 100110011010002 in words is "one hundred trillion, one hundred ten billion, eleven million, ten thousand, two".

Divisors: 1 2 7 14 67 134 469 938 106727090629 213454181258 747089634403 1494179268806 7150715072143 14301430144286 50055005505001 100110011010002