Search a number
-
+
320100111026 = 2160050055513
BaseRepresentation
bin1001010100001110111…
…01000001001010110010
31010121020022211110111122
410222013131001022302
520221031112023101
6403015120142242
732061244023203
oct4520735011262
91117208743448
10320100111026
11113832193203
1252054a67982
1324254188727
14116c88475aa
1584d710251b
hex4a877412b2

320100111026 has 4 divisors (see below), whose sum is σ = 480150166542. Its totient is φ = 160050055512.

The previous prime is 320100111017. The next prime is 320100111119. The reversal of 320100111026 is 620111001023.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 180561255625 + 139538855401 = 424925^2 + 373549^2 .

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

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, 80025027755 + ... + 80025027758.

Almost surely, 2320100111026 is an apocalyptic number.

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

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

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

The sum of its prime factors is 160050055515.

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

Adding to 320100111026 its reverse (620111001023), we get a palindrome (940211112049).

The spelling of 320100111026 in words is "three hundred twenty billion, one hundred million, one hundred eleven thousand, twenty-six".

Divisors: 1 2 160050055513 320100111026