Search a number
-
+
110110010111001 = 3271172316134759
BaseRepresentation
bin11001000010010011111100…
…000010011111010000011001
3112102212102011220222110011200
4121002103330002133100121
5103413020300042023001
61030103501302144413
732123120461161255
oct3102237402372031
9472772156873150
10110110010111001
11320a24361668aa
1210424083722109
1349594388cb5b4
141d294d25d7265
15cae332656086
hex6424fc09f419

110110010111001 has 12 divisors (see below), whose sum is σ = 161287902135360. Its totient is φ = 72372776598360.

The previous prime is 110110010110963. The next prime is 110110010111033. The reversal of 110110010111001 is 100111010011011.

It is not a de Polignac number, because 110110010111001 - 213 = 110110010102809 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 86158066741 + ... + 86158068018.

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

Almost surely, 2110110010111001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 172316134836 (or 172316134833 counting only the distinct ones).

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

Adding to 110110010111001 its reverse (100111010011011), we get a palindrome (210221020122012).

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

Divisors: 1 3 9 71 213 639 172316134759 516948404277 1550845212831 12234445567889 36703336703667 110110010111001