Search a number
-
+
10110200201011 = 17234983391699
BaseRepresentation
bin1001001100011111011011…
…1001000011111100110011
31022210112012020100111100201
42103013312321003330303
52311121142222413021
633300321205500031
72062303120530211
oct223076671037463
938715166314321
1010110200201011
113248791494109
121173511711617
13584506c80061
1426d49cb47cb1
15127ec98d4591
hex931f6e43f33

10110200201011 has 6 divisors (see below), whose sum is σ = 10739901251900. Its totient is φ = 9515482541856.

The previous prime is 10110200200967. The next prime is 10110200201029. The reversal of 10110200201011 is 11010200201101.

It is not a de Polignac number, because 10110200201011 - 213 = 10110200192819 is a prime.

It is a super-3 number, since 3×101102002010113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Duffinian number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 17491695561 + ... + 17491696138.

Almost surely, 210110200201011 is an apocalyptic number.

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

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

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

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

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

Adding to 10110200201011 its reverse (11010200201101), we get a palindrome (21120400402112).

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

Divisors: 1 17 289 34983391699 594717658883 10110200201011