Search a number
-
+
110102102001 = 3271172303759
BaseRepresentation
bin110011010001010011…
…0001011111111110001
3101112012012112021222200
41212202212023333301
53300442114231001
6122325154053413
710645301265633
oct1464246137761
9345165467880
10110102102001
114276a847931
1219408b7a269
13a4c86c83a8
1454869a0a53
152ce6065086
hex19a298bff1

110102102001 has 12 divisors (see below), whose sum is σ = 161276319360. Its totient is φ = 72367578360.

The previous prime is 110102101997. The next prime is 110102102009. The reversal of 110102102001 is 100201201011.

It is a happy number.

It is not a de Polignac number, because 110102102001 - 22 = 110102101997 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 (110102102009) 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, 86151241 + ... + 86152518.

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

Almost surely, 2110102102001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 110102102001 its reverse (100201201011), we get a palindrome (210303303012).

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

Divisors: 1 3 9 71 213 639 172303759 516911277 1550733831 12233566889 36700700667 110102102001