Search a number
-
+
10534341553 = 29363253157
BaseRepresentation
bin10011100111110010…
…10100101110110001
31000012011012222221021
421303321110232301
5133033242412203
64501151255441
7522023266021
oct116371245661
930164188837
1010534341553
1145163a77aa
12205bb1a581
13cbb6076c8
1471d0d7a81
15419c5b5bd
hex273e54bb1

10534341553 has 4 divisors (see below), whose sum is σ = 10897594740. Its totient is φ = 10171088368.

The previous prime is 10534341509. The next prime is 10534341563. The reversal of 10534341553 is 35514343501.

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

It can be written as a sum of positive squares in 2 ways, for example, as 3637537344 + 6896804209 = 60312^2 + 83047^2 .

It is a cyclic number.

It is not a de Polignac number, because 10534341553 - 213 = 10534333361 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 210534341553 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 363253186.

The product of its (nonzero) digits is 54000, while the sum is 34.

The spelling of 10534341553 in words is "ten billion, five hundred thirty-four million, three hundred forty-one thousand, five hundred fifty-three".

Divisors: 1 29 363253157 10534341553