Search a number
-
+
10132303222 = 25066151611
BaseRepresentation
bin10010110111110111…
…01010110101110110
3222011010201100000201
421123323222311312
5131222332200342
64353230231114
7506042104426
oct113373526566
928133640021
1010132303222
11432a46a418
121b6935549a
13c562313c2
146c1962486
153e47e3db7
hex25beead76

10132303222 has 4 divisors (see below), whose sum is σ = 15198454836. Its totient is φ = 5066151610.

The previous prime is 10132303211. The next prime is 10132303231. The reversal of 10132303222 is 22230323101.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10132303222.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2533075804 + ... + 2533075807.

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

Almost surely, 210132303222 is an apocalyptic number.

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

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

10132303222 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 5066151613.

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

Adding to 10132303222 its reverse (22230323101), we get a palindrome (32362626323).

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

Divisors: 1 2 5066151611 10132303222