Search a number
-
+
110010141010011 = 3112303058239697
BaseRepresentation
bin11001000000110110111011…
…011000000110100001011011
3112102111212101212122110121110
4121000312323120012201123
5103404401232044310021
61025545543332511403
732112653563626444
oct3100667330064133
9472455355573543
10110010141010011
1132064047707100
121040885177b563
13494cbb12608b8
141d2473aacc2cb
15cab939b76476
hex640dbb60685b

110010141010011 has 12 divisors (see below), whose sum is σ = 161226983519336. Its totient is φ = 66672812733120.

The previous prime is 110010141009961. The next prime is 110010141010067.

110010141010011 is nontrivially palindromic in base 10.

It is not a de Polignac number, because 110010141010011 - 213 = 110010141001819 is a prime.

It is a super-2 number, since 2×1100101410100112 (a number of 29 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (110010141010711) 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, 151529119486 + ... + 151529120211.

Almost surely, 2110010141010011 is an apocalyptic number.

110010141010011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

110010141010011 is an evil number, because the sum of its binary digits is even.

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

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

The spelling of 110010141010011 in words is "one hundred ten trillion, ten billion, one hundred forty-one million, ten thousand, eleven".

Divisors: 1 3 11 33 121 363 303058239697 909174719091 3333640636667 10000921910001 36670047003337 110010141010011