Search a number
-
+
110000001010012 = 221051238310980091
BaseRepresentation
bin11001000000101101011110…
…111111000100100101011100
3112102110220020012110002120221
4121000231132333010211130
5103404220000224310022
61025541145225251124
732112144366224311
oct3100553677044534
9472426205402527
10110000001010012
113205a813970013
12104068a1933aa4
13494bc565660b9
141d24058124d08
15cab544861cc7
hex640b5efc495c

110000001010012 has 24 divisors (see below), whose sum is σ = 192764035611392. Its totient is φ = 54924606198000.

The previous prime is 110000001009979. The next prime is 110000001010043. The reversal of 110000001010012 is 210010100000011.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4528087 + ... + 15508177.

Almost surely, 2110000001010012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 110000001010012 its reverse (210010100000011), we get a palindrome (320010101010023).

The spelling of 110000001010012 in words is "one hundred ten trillion, one million, ten thousand, twelve".

Divisors: 1 2 4 1051 2102 2383 4204 4766 9532 2504533 5009066 10018132 10980091 21960182 43920364 11540075641 23080151282 26165556853 46160302564 52331113706 104662227412 27500000252503 55000000505006 110000001010012