Search a number
-
+
11010032210 = 251101003221
BaseRepresentation
bin10100100000011111…
…11100001001010010
31001102022022120211202
422100033330021102
5140022032012320
65020303111202
7536560505162
oct122017741122
931368276752
1011010032210
11473a970181
1221732a2502
13106602aa78
147663625a2
154468c1b75
hex2903fc252

11010032210 has 8 divisors (see below), whose sum is σ = 19818057996. Its totient is φ = 4404012880.

The previous prime is 11010032197. The next prime is 11010032227. The reversal of 11010032210 is 1223001011.

It can be written as a sum of positive squares in 2 ways, for example, as 10916697289 + 93334921 = 104483^2 + 9661^2 .

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550501601 + ... + 550501620.

Almost surely, 211010032210 is an apocalyptic number.

11010032210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1101003228.

The product of its (nonzero) digits is 12, while the sum is 11.

Adding to 11010032210 its reverse (1223001011), we get a palindrome (12233033221).

The spelling of 11010032210 in words is "eleven billion, ten million, thirty-two thousand, two hundred ten".

Divisors: 1 2 5 10 1101003221 2202006442 5505016105 11010032210