Search a number
-
+
1032100013202 = 23172016668867
BaseRepresentation
bin11110000010011011111…
…01000110010010010010
310122200000211021001101220
433001031331012102102
5113402220100410302
62110050141105510
7134365254235236
oct17011575062222
93580024231356
101032100013202
11368790606a25
12148040258296
13764327547ab
1437d4d7425c6
151bca990b4bc
hexf04df46492

1032100013202 has 8 divisors (see below), whose sum is σ = 2064200026416. Its totient is φ = 344033337732.

The previous prime is 1032100013159. The next prime is 1032100013221. The reversal of 1032100013202 is 2023100012301.

It is a sphenic number, since it is the product of 3 distinct primes.

1032100013202 is an admirable 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, 86008334428 + ... + 86008334439.

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

Almost surely, 21032100013202 is an apocalyptic number.

1032100013202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 172016668872.

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

Adding to 1032100013202 its reverse (2023100012301), we get a palindrome (3055200025503).

Subtracting 1032100013202 from its reverse (2023100012301), we obtain a palindrome (990999999099).

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

Divisors: 1 2 3 6 172016668867 344033337734 516050006601 1032100013202