Search a number
-
+
110010010011110 = 25111000091000101
BaseRepresentation
bin11001000000110110110011…
…100100011000010111100110
3112102111212001202011000220022
4121000312303210120113212
5103404401000030323420
61025545522333035142
732112650413305446
oct3100666344302746
9472455052130808
10110010010011110
1132063a8a772750
1210408815925ab2
13494cb90085561
141d2472754c126
15cab92d3ebc25
hex640db39185e6

110010010011110 has 16 divisors (see below), whose sum is σ = 216019656022032. Its totient is φ = 40003640004000.

The previous prime is 110010010011107. The next prime is 110010010011127. The reversal of 110010010011110 is 11110010010011.

110010010011110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2110010010011110 is an apocalyptic number.

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

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

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

110010010011110 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1000091000119.

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

Adding to 110010010011110 its reverse (11110010010011), we get a palindrome (121120020021121).

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

Divisors: 1 2 5 10 11 22 55 110 1000091000101 2000182000202 5000455000505 10000910001010 11001001001111 22002002002222 55005005005555 110010010011110