Search a number
-
+
3055377031131 = 31018459010377
BaseRepresentation
bin101100011101100010101…
…010011001111111011011
3101211002110110220221010010
4230131202222121333123
5400024403004444011
610255342033253003
7433513043153325
oct54354252317733
911732413827103
103055377031131
11a78861753907
1241419b704163
1319217558a249
14a7c497d0615
15547261b81a6
hex2c762a99fdb

3055377031131 has 4 divisors (see below), whose sum is σ = 4073836041512. Its totient is φ = 2036918020752.

The previous prime is 3055377031129. The next prime is 3055377031181. The reversal of 3055377031131 is 1311307735503.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 3055377031131 - 21 = 3055377031129 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 509229505186 + ... + 509229505191.

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

Almost surely, 23055377031131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1018459010380.

The product of its (nonzero) digits is 99225, while the sum is 39.

The spelling of 3055377031131 in words is "three trillion, fifty-five billion, three hundred seventy-seven million, thirty-one thousand, one hundred thirty-one".

Divisors: 1 3 1018459010377 3055377031131