Search a number
-
+
10110203001 = 341093114197
BaseRepresentation
bin10010110101001110…
…10111010001111001
3222002121010112020000
421122213113101321
5131201202444001
64351120423213
7505353210333
oct113247272171
928077115200
1010110203001
114318a45178
121b61a77b09
13c51794052
146bca4c453
153e28caa86
hex25a9d7479

10110203001 has 20 divisors (see below), whose sum is σ = 15116846052. Its totient is φ = 6733909728.

The previous prime is 10110202967. The next prime is 10110203021. The reversal of 10110203001 is 10030201101.

It can be written as a sum of positive squares in 2 ways, for example, as 9066848400 + 1043354601 = 95220^2 + 32301^2 .

It is not a de Polignac number, because 10110203001 - 215 = 10110170233 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 (10110203021) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 31435 + ... + 145631.

Almost surely, 210110203001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 10110203001 its reverse (10030201101), we get a palindrome (20140404102).

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

Divisors: 1 3 9 27 81 1093 3279 9837 29511 88533 114197 342591 1027773 3083319 9249957 124817321 374451963 1123355889 3370067667 10110203001