Search a number
-
+
100110010110010 = 2510011001011001
BaseRepresentation
bin10110110000110010101101…
…100101110101000000111010
3111010110102102201202010222121
4112300302231211311000322
5101110200300042010020
6552525523113111454
730041465242511035
oct2660625545650072
9433412381663877
10100110010110010
112999746493206a
12b289ba79b858a
1343b24447727b4
141aa14c94a801c
15b89157712baa
hex5b0cad97503a

100110010110010 has 8 divisors (see below), whose sum is σ = 180198018198036. Its totient is φ = 40044004044000.

The previous prime is 100110010109971. The next prime is 100110010110041. The reversal of 100110010110010 is 10011010011001.

It is a happy number.

It can be written as a sum of positive squares in 2 ways, for example, as 92104002108889 + 8006008001121 = 9597083^2 + 2829489^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 = 100110010109975 and 100110010110002.

It is an unprimeable number.

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

Almost surely, 2100110010110010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10011001011008.

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

Adding to 100110010110010 its reverse (10011010011001), we get a palindrome (110121020121011).

Subtracting from 100110010110010 its reverse (10011010011001), we obtain a palindrome (90099000099009).

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

Divisors: 1 2 5 10 10011001011001 20022002022002 50055005055005 100110010110010