Search a number
-
+
102000010112011 = 119272728192001
BaseRepresentation
bin10111001100010010111010…
…010111101010110000001011
3111101011002212002012010022201
4113030102322113222300023
5101332132010042041021
61000534054024301031
730325154223454354
oct2714227227526013
9441132762163281
10102000010112011
112a555a636342a0
12b534351011777
1344bb73780ab4b
141b28b80b74d2b
15bbd3c35e8591
hex5cc4ba5eac0b

102000010112011 has 4 divisors (see below), whose sum is σ = 111272738304024. Its totient is φ = 92727281920000.

The previous prime is 102000010111999. The next prime is 102000010112057. The reversal of 102000010112011 is 110211010000201.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 102000010112011 - 29 = 102000010111499 is a prime.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4636364095990 + ... + 4636364096011.

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

Almost surely, 2102000010112011 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 9272728192012.

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

Adding to 102000010112011 its reverse (110211010000201), we get a palindrome (212211020112212).

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

Divisors: 1 11 9272728192001 102000010112011