Search a number
-
+
1054151004532 = 22407249647117
BaseRepresentation
bin11110101011100000100…
…10111101000101110100
310201202221121002110211111
433111300102331011310
5114232400124121112
62124134214244404
7136105562460553
oct17256022750564
93652847073744
101054151004532
113770768400aa
12150375056704
137853801b162
1439042197d9a
151c64a75d5a7
hexf5704bd174

1054151004532 has 12 divisors (see below), whose sum is σ = 1844771638500. Its totient is φ = 527073393536.

The previous prime is 1054151004509. The next prime is 1054151004539. The reversal of 1054151004532 is 2354001514501.

It can be written as a sum of positive squares in 2 ways, for example, as 376107452176 + 678043552356 = 613276^2 + 823434^2 .

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

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

It is a congruent number.

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

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

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

Almost surely, 21054151004532 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 12000, while the sum is 31.

The spelling of 1054151004532 in words is "one trillion, fifty-four billion, one hundred fifty-one million, four thousand, five hundred thirty-two".

Divisors: 1 2 4 407249 647117 814498 1294234 1628996 2588468 263537751133 527075502266 1054151004532