Search a number
-
+
110000102002 = 27571108712659
BaseRepresentation
bin110011001110010000…
…1000101101001110010
3101111221002121011021221
41212130201011221302
53300240011231002
6122311111535254
710642622303560
oct1463441055162
9344832534257
10110000102002
114271820a80a
121939a98a52a
13a4b053446b
14547720ca30
152cdc117c37
hex199c845a72

110000102002 has 32 divisors (see below), whose sum is σ = 189090570240. Its totient is φ = 47013330960.

The previous prime is 110000101993. The next prime is 110000102011. The reversal of 110000102002 is 200201000011.

It is an interprime number because it is at equal distance from previous prime (110000101993) and next prime (110000102011).

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8683149 + ... + 8695807.

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

Almost surely, 2110000102002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 14326.

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

Adding to 110000102002 its reverse (200201000011), we get a palindrome (310201102013).

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

Divisors: 1 2 7 14 571 1087 1142 2174 3997 7609 7994 12659 15218 25318 88613 177226 620677 1241354 4344739 7228289 8689478 13760333 14456578 27520666 50598023 96322331 101196046 192644662 7857150143 15714300286 55000051001 110000102002