Search a number
-
+
10110200001 = 311306369697
BaseRepresentation
bin10010110101001110…
…10110100011000001
3222002121010101002220
421122213112203001
5131201202400001
64351120401253
7505353165516
oct113247264301
928077111086
1010110200001
114318a429a0
121b61a76229
13c51792885
146bca4b30d
153e28c9c36
hex25a9d68c1

10110200001 has 8 divisors (see below), whose sum is σ = 14705745504. Its totient is φ = 6127393920.

The previous prime is 10110199997. The next prime is 10110200011. The reversal of 10110200001 is 10000201101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 10110200001 - 22 = 10110199997 is a prime.

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

It is a Curzon number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 153184816 + ... + 153184881.

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

Almost surely, 210110200001 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 306369711.

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

Adding to 10110200001 its reverse (10000201101), we get a palindrome (20110401102).

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

Divisors: 1 3 11 33 306369697 919109091 3370066667 10110200001