Search a number
-
+
291102201093 = 31137612345461
BaseRepresentation
bin1000011110001110000…
…10110001010100000101
31000211101102011000021110
410033013002301110011
514232134130413333
6341421442235233
730013532611554
oct4170702612405
91024342130243
10291102201093
11102501670290
1248501655b19
13215b25b2c42
1410137531d9b
15788b46e063
hex43c70b1505

291102201093 has 16 divisors (see below), whose sum is σ = 423534146112. Its totient is φ = 176378592000.

The previous prime is 291102201067. The next prime is 291102201121. The reversal of 291102201093 is 390102201192.

It is not a de Polignac number, because 291102201093 - 216 = 291102135557 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 291102201093.

It is a congruent number.

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

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

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

Almost surely, 2291102201093 is an apocalyptic number.

It is an amenable number.

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

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

291102201093 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2349236.

The product of its (nonzero) digits is 1944, while the sum is 30.

Subtracting 291102201093 from its reverse (390102201192), we obtain a palindrome (99000000099).

The spelling of 291102201093 in words is "two hundred ninety-one billion, one hundred two million, two hundred one thousand, ninety-three".

Divisors: 1 3 11 33 3761 11283 41371 124113 2345461 7036383 25800071 77400213 8821278821 26463836463 97034067031 291102201093