Search a number
-
+
10144166132 = 222536041533
BaseRepresentation
bin10010111001010001…
…11011000011110100
3222011222001000212202
421130220323003310
5131233401304012
64354332404032
7506244663242
oct113450730364
928158030782
1010144166132
114336132181
121b71316618
13c58825b89
146c336d792
153e5888cc2
hex25ca3b0f4

10144166132 has 6 divisors (see below), whose sum is σ = 17752290738. Its totient is φ = 5072083064.

The previous prime is 10144166119. The next prime is 10144166159. The reversal of 10144166132 is 23166144101.

10144166132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in only one way, i.e., 9262907536 + 881258596 = 96244^2 + 29686^2 .

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

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 210144166132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 3456, while the sum is 29.

The spelling of 10144166132 in words is "ten billion, one hundred forty-four million, one hundred sixty-six thousand, one hundred thirty-two".

Divisors: 1 2 4 2536041533 5072083066 10144166132