Search a number
-
+
553255707552355 = 5110651141510471
BaseRepresentation
bin111110111001011101110000…
…1111010110010101001100011
32200112220201200111212202001201
41331302323201322302221203
51040004020142113133410
65240402055134542031
7224351256122235163
oct17562734172625143
92615821614782051
10553255707552355
111503144786263a5
12520747b5067917
131a992a352b9152
149a89a0d3b25a3
1543e66b5bd783a
hex1f72ee1eb2a63

553255707552355 has 4 divisors (see below), whose sum is σ = 663906849062832. Its totient is φ = 442604566041880.

The previous prime is 553255707552347. The next prime is 553255707552367.

553255707552355 is nontrivially palindromic in base 10.

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

It is not a de Polignac number, because 553255707552355 - 23 = 553255707552347 is a prime.

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

It is a Duffinian number.

It is an unprimeable number.

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

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

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

Almost surely, 2553255707552355 is an apocalyptic number.

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

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

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

The sum of its prime factors is 110651141510476.

The product of its (nonzero) digits is 689062500, while the sum is 64.

The spelling of 553255707552355 in words is "five hundred fifty-three trillion, two hundred fifty-five billion, seven hundred seven million, five hundred fifty-two thousand, three hundred fifty-five".

Divisors: 1 5 110651141510471 553255707552355