Search a number
-
+
102011010110 = 2510201101011
BaseRepresentation
bin101111100000001010…
…1000111110000111110
3100202022022201020111122
41133000111013300332
53132404304310420
6114510241550542
710240633164512
oct1370025076076
9322268636448
10102011010110
113a298612829
121792b345452
139809340359
144d1a184142
1529c0a74725
hex17c0547c3e

102011010110 has 8 divisors (see below), whose sum is σ = 183619818216. Its totient is φ = 40804404040.

The previous prime is 102011010103. The next prime is 102011010113. The reversal of 102011010110 is 11010110201.

It is a happy number.

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

It is a congruent number.

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

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

Almost surely, 2102011010110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10201101018.

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

Adding to 102011010110 its reverse (11010110201), we get a palindrome (113021120311).

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

Divisors: 1 2 5 10 10201101011 20402202022 51005505055 102011010110