Search a number
-
+
102001102009 = 104579754337
BaseRepresentation
bin101111011111110111…
…1010100110010111001
3100202021122001212010221
41132333233110302321
53132344240231014
6114505245340041
710240453030102
oct1367757246271
9322248055127
10102001102009
113a292a65714
1217927b67621
139807281581
144d18b253a9
1529bec68b24
hex17bfbd4cb9

102001102009 has 4 divisors (see below), whose sum is σ = 102010866804. Its totient is φ = 101991337216.

The previous prime is 102001101997. The next prime is 102001102031. The reversal of 102001102009 is 900201100201.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 41842748025 + 60158353984 = 204555^2 + 245272^2 .

It is a cyclic number.

It is not a de Polignac number, because 102001102009 - 25 = 102001101977 is a prime.

It is a super-2 number, since 2×1020011020092 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 2102001102009 is an apocalyptic number.

It is an amenable number.

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

102001102009 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 9764794.

The product of its (nonzero) digits is 36, while the sum is 16.

The spelling of 102001102009 in words is "one hundred two billion, one million, one hundred two thousand, nine".

Divisors: 1 10457 9754337 102001102009