Search a number
-
+
2091509312055 = 35139433954137
BaseRepresentation
bin11110011011110111101…
…010110110101000110111
321101221112212202112222220
4132123313222312220313
5233231402340441210
64240454235053423
7304051356552222
oct36336752665067
97357485675886
102091509312055
11737005532409
122994222a1273
131222c7c892b7
147332ddd65b9
1539611ae2c70
hex1e6f7ab6a37

2091509312055 has 8 divisors (see below), whose sum is σ = 3346414899312. Its totient is φ = 1115471633088.

The previous prime is 2091509312051. The next prime is 2091509312111. The reversal of 2091509312055 is 5502139051902.

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

It is not a de Polignac number, because 2091509312055 - 22 = 2091509312051 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (2091509312051) 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, 69716977054 + ... + 69716977083.

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

Almost surely, 22091509312055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 139433954145.

The product of its (nonzero) digits is 121500, while the sum is 42.

The spelling of 2091509312055 in words is "two trillion, ninety-one billion, five hundred nine million, three hundred twelve thousand, fifty-five".

Divisors: 1 3 5 15 139433954137 418301862411 697169770685 2091509312055