Search a number
-
+
10324331102 = 25162165551
BaseRepresentation
bin10011001110110000…
…01100101001011110
3222122112001100202102
421213120030221132
5132121012043402
64424250125102
7513563236451
oct114730145136
928575040672
1010324331102
1144188a7848
122001720792
13c86c56b77
146dd26b498
154065c6102
hex26760ca5e

10324331102 has 4 divisors (see below), whose sum is σ = 15486496656. Its totient is φ = 5162165550.

The previous prime is 10324331077. The next prime is 10324331107. The reversal of 10324331102 is 20113342301.

10324331102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10324331107) by changing a digit.

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, 2581082774 + ... + 2581082777.

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

Almost surely, 210324331102 is an apocalyptic number.

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

10324331102 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 5162165553.

The product of its (nonzero) digits is 432, while the sum is 20.

Adding to 10324331102 its reverse (20113342301), we get a palindrome (30437673403).

The spelling of 10324331102 in words is "ten billion, three hundred twenty-four million, three hundred thirty-one thousand, one hundred two".

Divisors: 1 2 5162165551 10324331102