Search a number
-
+
10055546513 = 56317860651
BaseRepresentation
bin10010101110101101…
…10111011010010001
3221221210021200121122
421113112313122101
5131043204442023
64341445132025
7504120510065
oct112726673221
927853250548
1010055546513
1142a0103a21
121b476ba015
13c4336832c
146b56a1aa5
153dcbd12c8
hex2575b7691

10055546513 has 4 divisors (see below), whose sum is σ = 10073407728. Its totient is φ = 10037685300.

The previous prime is 10055546467. The next prime is 10055546533. The reversal of 10055546513 is 31564555001.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 10055546513 - 214 = 10055530129 is a prime.

It is a super-2 number, since 2×100555465132 (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 (10055546533) 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, 8929763 + ... + 8930888.

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

Almost surely, 210055546513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17861214.

The product of its (nonzero) digits is 45000, while the sum is 35.

The spelling of 10055546513 in words is "ten billion, fifty-five million, five hundred forty-six thousand, five hundred thirteen".

Divisors: 1 563 17860651 10055546513