Search a number
-
+
1110000200013 = 34103133045691
BaseRepresentation
bin10000001001110001001…
…010101110100101001101
310221010002211012120020000
4100021301022232211031
5121141240022400023
62205532124314513
7143123561011425
oct20116112564515
93833084176200
101110000200013
113988261a2301
1215b1609a2a39
13808988357a3
143ba1d67d485
151dd1889d243
hex102712ae94d

1110000200013 has 20 divisors (see below), whose sum is σ = 1674246988128. Its totient is φ = 732815660520.

The previous prime is 1110000200009. The next prime is 1110000200027. The reversal of 1110000200013 is 3100020000111.

It is not a de Polignac number, because 1110000200013 - 22 = 1110000200009 is a prime.

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

It is a Curzon number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 66514503 + ... + 66531188.

Almost surely, 21110000200013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 1110000200013 its reverse (3100020000111), we get a palindrome (4210020200124).

The spelling of 1110000200013 in words is "one trillion, one hundred ten billion, two hundred thousand, thirteen".

Divisors: 1 3 9 27 81 103 309 927 2781 8343 133045691 399137073 1197411219 3592233657 10776700971 13703706173 41111118519 123333355557 370000066671 1110000200013