Search a number
-
+
10732861145 = 52146572229
BaseRepresentation
bin10011111111011101…
…00111011011011001
31000200222202211121202
421333232213123121
5133440103024040
64533002243545
7526653546236
oct117756473331
930628684552
1010732861145
114608469486
1220b64b65b5
131020793c16
1473b61278d
1542c3c2015
hex27fba76d9

10732861145 has 4 divisors (see below), whose sum is σ = 12879433380. Its totient is φ = 8586288912.

The previous prime is 10732861121. The next prime is 10732861157. The reversal of 10732861145 is 54116823701.

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 1305810496 + 9427050649 = 36136^2 + 97093^2 .

It is a cyclic number.

It is not a de Polignac number, because 10732861145 - 212 = 10732857049 is a prime.

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

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

It is an unprimeable number.

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

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

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

Almost surely, 210732861145 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2146572234.

The product of its (nonzero) digits is 40320, while the sum is 38.

The spelling of 10732861145 in words is "ten billion, seven hundred thirty-two million, eight hundred sixty-one thousand, one hundred forty-five".

Divisors: 1 5 2146572229 10732861145