Search a number
-
+
102901111111 = 315956260859
BaseRepresentation
bin101111111010101100…
…0100101100101000111
3100211121100121001112101
41133311120211211013
53141220141023421
6115134435532531
710301662004251
oct1376530454507
9324540531471
10102901111111
113a704aa3897
1217b3945a147
13991b87c136
144da2484cd1
152a23c98191
hex17f5625947

102901111111 has 8 divisors (see below), whose sum is σ = 108020851200. Its totient is φ = 97893892920.

The previous prime is 102901111081. The next prime is 102901111123. The reversal of 102901111111 is 111111109201.

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

It is a cyclic number.

It is not a de Polignac number, because 102901111111 - 225 = 102867556679 is a prime.

It is a Duffinian number.

102901111111 is a modest number, since divided by 111111 gives 102901 as remainder.

It is a congruent number.

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

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

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

Almost surely, 2102901111111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 56260949.

The product of its (nonzero) digits is 18, while the sum is 19.

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

Divisors: 1 31 59 1829 56260859 1744086629 3319390681 102901111111