Search a number
-
+
10110303313 = 11191013311447
BaseRepresentation
bin10010110101001111…
…01111110001010001
3222002121022121211021
421122213233301101
5131201214201223
64351122515441
7505354105645
oct113247576121
928077277737
1010110303313
114319003580
121b61b05b81
13c517ca8c6
146bca76c25
153e28ea65d
hex25a9efc51

10110303313 has 32 divisors (see below), whose sum is σ = 11768417280. Its totient is φ = 8589240000.

The previous prime is 10110303253. The next prime is 10110303331. The reversal of 10110303313 is 31330301101.

It is not a de Polignac number, because 10110303313 - 225 = 10076748881 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10110303013) 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 31 ways as a sum of consecutive naturals, for example, 6986356 + ... + 6987802.

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

Almost surely, 210110303313 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1909.

The product of its (nonzero) digits is 81, while the sum is 16.

Adding to 10110303313 its reverse (31330301101), we get a palindrome (41440604414).

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

Divisors: 1 11 19 101 209 331 1111 1447 1919 3641 6289 15917 21109 27493 33431 69179 146147 302423 367741 478957 635189 1607617 2776793 5268527 6987079 9100183 30544723 48374657 100102013 532121227 919118483 10110303313