Search a number
-
+
1032201013102 = 27210532663399
BaseRepresentation
bin11110000010100111111…
…10011000011101101110
310122200021212022101012221
433001103332120131232
5113402421424404402
62110104145545554
7134400621563500
oct17012376303556
93580255271187
101032201013102
11368832620716
1214806a0452ba
137644a65844c
1437d5cd13d70
151bcb370c337
hexf053f9876e

1032201013102 has 12 divisors (see below), whose sum is σ = 1801085441400. Its totient is φ = 442371862716.

The previous prime is 1032201013099. The next prime is 1032201013127. The reversal of 1032201013102 is 2013101022301.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5266331602 + ... + 5266331797.

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

Almost surely, 21032201013102 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 72, while the sum is 16.

Adding to 1032201013102 its reverse (2013101022301), we get a palindrome (3045302035403).

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

Divisors: 1 2 7 14 49 98 10532663399 21065326798 73728643793 147457287586 516100506551 1032201013102