Search a number
-
+
1036232106232 = 23523692473391
BaseRepresentation
bin11110001010001000011…
…11110010000011111000
310200001200210112010102111
433011010033302003320
5113434200404344412
62112012150142104
7134602540400551
oct17050417620370
93601623463374
101036232106232
1136a511011644
121489b4051934
137694084555b
143822243d328
151be4c5752a7
hexf1443f20f8

1036232106232 has 16 divisors (see below), whose sum is σ = 1942973085600. Its totient is φ = 518105950080.

The previous prime is 1036232106167. The next prime is 1036232106331. The reversal of 1036232106232 is 2326012326301.

It is a super-3 number, since 3×10362321062323 (a number of 37 digits) contains 333 as substring.

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

It is a congruent number.

It is an unprimeable number.

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 in 3 ways as a sum of consecutive naturals, for example, 817744 + ... + 1655647.

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

Almost surely, 21036232106232 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The spelling of 1036232106232 in words is "one trillion, thirty-six billion, two hundred thirty-two million, one hundred six thousand, two hundred thirty-two".

Divisors: 1 2 4 8 52369 104738 209476 418952 2473391 4946782 9893564 19787128 129529013279 259058026558 518116053116 1036232106232