Search a number
-
+
102010010110 = 2517600058883
BaseRepresentation
bin101111100000001000…
…1010011100111111110
3100202022020211102202121
41133000101103213332
53132404030310420
6114510204313154
710240621531201
oct1370021234776
9322266742677
10102010010110
113a297a9a488
121792ab427ba
139809080138
144d19da3938
1529c09282aa
hex17c04539fe

102010010110 has 16 divisors (see below), whose sum is σ = 194419078416. Its totient is φ = 38403768448.

The previous prime is 102010010099. The next prime is 102010010111. The reversal of 102010010110 is 11010010201.

It is a junction number, because it is equal to n+sod(n) for n = 102010010093 and 102010010102.

It is a congruent number.

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

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

Almost surely, 2102010010110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 600058907.

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

Adding to 102010010110 its reverse (11010010201), we get a palindrome (113020020311).

Subtracting from 102010010110 its reverse (11010010201), we obtain a palindrome (90999999909).

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

Divisors: 1 2 5 10 17 34 85 170 600058883 1200117766 3000294415 6000588830 10201001011 20402002022 51005005055 102010010110