Search a number
-
+
10110113301 = 33370037767
BaseRepresentation
bin10010110101001110…
…00001011000010101
3222002120221222011210
421122213001120111
5131201142111201
64351114452033
7505352354661
oct113247013025
928076858153
1010110113301
114318993842
121b61a34019
13c51762282
146bca278a1
153e28ae1d6
hex25a9c1615

10110113301 has 4 divisors (see below), whose sum is σ = 13480151072. Its totient is φ = 6740075532.

The previous prime is 10110113291. The next prime is 10110113303. The reversal of 10110113301 is 10331101101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 10110113301 - 25 = 10110113269 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 210110113301 is an apocalyptic number.

It is an amenable number.

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

10110113301 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 3370037770.

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

Adding to 10110113301 its reverse (10331101101), we get a palindrome (20441214402).

The spelling of 10110113301 in words is "ten billion, one hundred ten million, one hundred thirteen thousand, three hundred one".

Divisors: 1 3 3370037767 10110113301