Search a number
BaseRepresentation
bin1100001010010…
…01000001111001
321002221200210020
412011021001321
5202103323001
614042241053
72346036111
oct605110171
9232850706
10102011001
1152645414
122a1b6189
1318198c51
14d796041
158e50736
hex6149079

102011001 has 8 divisors (see below), whose sum is σ = 136206720. Its totient is φ = 67911312.

The previous prime is 102010991. The next prime is 102011017. The reversal of 102011001 is 100110201.

Adding to 102011001 its reverse (100110201), we get a palindrome (202121202).

It can be divided in two parts, 10201 and 1001, that multiplied together give a palindrome (10211201).

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 102011001 - 27 = 102010873 is a prime.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21490 + ... + 25803.

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

Almost surely, 2102011001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 48015.

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

The square root of 102011001 is about 10100.0495543339. The cubic root of 102011001 is about 467.2496697115.

The spelling of 102011001 in words is "one hundred two million, eleven thousand, one".