Search a number
BaseRepresentation
bin10000001001110001001…
…001111101111111101010
310221010002210211110020020
4100021301021331333222
5121141240000013002
62205532120141310
7143123556222264
oct20116111757752
93833083743206
101110000001002
11398826076832
1215b160907836
1380898796029
143ba1d62ab34
151dd1885e2bc
hex1027127dfea

1110000001002 has 64 divisors (see below), whose sum is σ = 2368140364800. Its totient is φ = 345636345600.

The previous prime is 1110000000997. The next prime is 1110000001039. The reversal of 1110000001002 is 2001000000111.

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

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67464877 + ... + 67481327.

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

Almost surely, 21110000001002 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 21371.

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

Adding to 1110000001002 its reverse (2001000000111), we get a palindrome (3111000001113).

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