Search a number
-
+
13106051032 = 231638256379
BaseRepresentation
bin11000011010010111…
…00111011111011000
31020211101100101010111
430031023213133120
5203320122113112
610004300054104
7642531411214
oct141513473730
936741311114
1013106051032
11561602a138
122659234334
13130b3537a9
148c4893944
1551a8ee5a7
hex30d2e77d8

13106051032 has 8 divisors (see below), whose sum is σ = 24573845700. Its totient is φ = 6553025512.

The previous prime is 13106051029. The next prime is 13106051039. The reversal of 13106051032 is 23015060131.

It is a happy number.

It is a tau number, because it is divible by the number of its divisors (8).

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (13106051039) 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 as a sum of consecutive naturals, namely, 819128182 + ... + 819128197.

Almost surely, 213106051032 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 540, while the sum is 22.

Subtracting 13106051032 from its reverse (23015060131), we obtain a palindrome (9909009099).

The spelling of 13106051032 in words is "thirteen billion, one hundred six million, fifty-one thousand, thirty-two".

Divisors: 1 2 4 8 1638256379 3276512758 6553025516 13106051032