Search a number
-
+
120110002010 = 2512011000201
BaseRepresentation
bin110111111011100011…
…1010010111101011010
3102111000200011021212222
41233313013102331122
53431441130031020
6131102222104042
711451303112655
oct1576707227532
9374020137788
10120110002010
1146a35a68279
121b34071b022
13b431c2060b
145b55bbc89c
1531ce983b25
hex1bf71d2f5a

120110002010 has 8 divisors (see below), whose sum is σ = 216198003636. Its totient is φ = 48044000800.

The previous prime is 120110001959. The next prime is 120110002037. The reversal of 120110002010 is 10200011021.

120110002010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 2 ways, for example, as 120042153841 + 67848169 = 346471^2 + 8237^2 .

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

It is a Curzon number.

It is an unprimeable number.

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

Almost surely, 2120110002010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 12011000208.

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

Adding to 120110002010 its reverse (10200011021), we get a palindrome (130310013031).

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

Divisors: 1 2 5 10 12011000201 24022000402 60055001005 120110002010