Search a number
-
+
110010010110002 = 2131419885534771
BaseRepresentation
bin11001000000110110110011…
…100100110000100000110010
3112102111212001202100001112222
4121000312303210300200302
5103404401000042010002
61025545522335121042
732112650414166662
oct3100666344604062
9472455052301488
10110010010110002
1132063a8a82aa82
1210408815973182
13494cb900bb582
141d247275761a2
15cab92d41b1a2
hex640db3930832

110010010110002 has 8 divisors (see below), whose sum is σ = 166274671769712. Its totient is φ = 54585119520100.

The previous prime is 110010010109911. The next prime is 110010010110031. The reversal of 110010010110002 is 200011010010011.

It is a happy number.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 209942767124 + ... + 209942767647.

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

Almost surely, 2110010010110002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 419885534904.

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

Adding to 110010010110002 its reverse (200011010010011), we get a palindrome (310021020120013).

Subtracting 110010010110002 from its reverse (200011010010011), we obtain a palindrome (90000999900009).

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

Divisors: 1 2 131 262 419885534771 839771069542 55005005055001 110010010110002