Search a number
-
+
102001112001 = 3319928321419
BaseRepresentation
bin101111011111110111…
…1010111001111000001
3100202021122002100212000
41132333233113033001
53132344241041001
6114505245454213
710240453101165
oct1367757271701
9322248070760
10102001112001
113a292a72178
1217927b71369
139807285c99
144d18b28ca5
1529bec6ba86
hex17bfbd73c1

102001112001 has 32 divisors (see below), whose sum is σ = 159090624000. Its totient is φ = 64411807824.

The previous prime is 102001111973. The next prime is 102001112009. The reversal of 102001112001 is 100211100201.

It is a happy number.

It is not a de Polignac number, because 102001112001 - 26 = 102001111937 is a prime.

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

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

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

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

Almost surely, 2102001112001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 102001112001 its reverse (100211100201), we get a palindrome (202212212202).

The spelling of 102001112001 in words is "one hundred two billion, one million, one hundred twelve thousand, one".

Divisors: 1 3 9 19 27 57 171 513 9283 21419 27849 64257 83547 176377 192771 250641 406961 529131 578313 1220883 1587393 3662649 4762179 10987947 198832577 596497731 1789493193 3777818963 5368479579 11333456889 34000370667 102001112001