Search a number
-
+
102010230110 = 2510201023011
BaseRepresentation
bin101111100000001001…
…0001001010101011110
3100202022021020121112202
41133000102021111132
53132404104330420
6114510213131502
710240623435455
oct1370022112536
9322267217482
10102010230110
113a29812a7a8
121792b029b92
139809129309
144d1a01db9c
1529c096d575
hex17c048955e

102010230110 has 8 divisors (see below), whose sum is σ = 183618414216. Its totient is φ = 40804092040.

The previous prime is 102010230103. The next prime is 102010230121. The reversal of 102010230110 is 11032010201.

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

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

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2102010230110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10201023018.

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

Adding to 102010230110 its reverse (11032010201), we get a palindrome (113042240311).

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

Divisors: 1 2 5 10 10201023011 20402046022 51005115055 102010230110