Search a number
-
+
110110102001 = 2946716634889
BaseRepresentation
bin110011010001100010…
…0101101000111110001
3101112012202120201220222
41212203010231013301
53301001141231001
6122330041342425
710645426265354
oct1464304550761
9345182521828
10110110102001
11427743113a9
121940b797a15
13a4ca269813
145487a8429b
152ce6ae561b
hex19a312d1f1

110110102001 has 16 divisors (see below), whose sum is σ = 114242918400. Its totient is φ = 106000073088.

The previous prime is 110110101971. The next prime is 110110102007. The reversal of 110110102001 is 100201011011.

It is a happy number.

It is a cyclic number.

It is not a de Polignac number, because 110110102001 - 210 = 110110100977 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 110110102001.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22519565 + ... + 22524453.

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

Almost surely, 2110110102001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 7048.

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

Adding to 110110102001 its reverse (100201011011), we get a palindrome (210311113012).

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

Divisors: 1 29 467 1663 4889 13543 48227 141781 776621 2283163 8130407 22522009 66211727 235781803 3796900069 110110102001