Search a number
-
+
110010201210 = 232571319706961
BaseRepresentation
bin110011001110100011…
…1100111010001111010
3101111221210121020210200
41212131013213101322
53300300102414320
6122312112223030
710643104165410
oct1463507472172
9344853536720
10110010201210
1142722988468
12193a223aa76
13a4b265c220
1454786bb2b0
152cdce60290
hex199d1e747a

110010201210 has 192 divisors, whose sum is σ = 370561201920. Its totient is φ = 21989283840.

The previous prime is 110010201193. The next prime is 110010201211. The reversal of 110010201210 is 12102010011.

It is a happy number.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 197871 + ... + 509090.

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

Almost surely, 2110010201210 is an apocalyptic number.

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

110010201210 is an abundant number, since it is smaller than the sum of its proper divisors (260551000710).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 707013 (or 707010 counting only the distinct ones).

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

Adding to 110010201210 its reverse (12102010011), we get a palindrome (122112211221).

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