Search a number
-
+
536432140263056 = 2433527008766441
BaseRepresentation
bin111100111111000011101011…
…1001010101001111010010000
32121100100102010011221212010212
41321332013113022221322100
51030302401010401404211
65140521305001343252
7220663641336604202
oct17176072712517220
92540312104855125
10536432140263056
11145a1865846aa44
12501b8186497b28
131a0424453b049b
149667650170772
154203c6e9ee38b
hex1e7e1d72a9e90

536432140263056 has 10 divisors (see below), whose sum is σ = 1039337271759702. Its totient is φ = 268216070131520.

The previous prime is 536432140262971. The next prime is 536432140263073. The reversal of 536432140263056 is 650362041234635.

It is a happy number.

It can be written as a sum of positive squares in only one way, i.e., 378239640211456 + 158192500051600 = 19448384^2 + 12577460^2 .

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

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

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16763504383205 + ... + 16763504383236.

Almost surely, 2536432140263056 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 33527008766449 (or 33527008766443 counting only the distinct ones).

The product of its (nonzero) digits is 9331200, while the sum is 50.

The spelling of 536432140263056 in words is "five hundred thirty-six trillion, four hundred thirty-two billion, one hundred forty million, two hundred sixty-three thousand, fifty-six".

Divisors: 1 2 4 8 16 33527008766441 67054017532882 134108035065764 268216070131528 536432140263056