Search a number
-
+
10111011002 = 223219804587
BaseRepresentation
bin10010110101010100…
…11100100010111010
3222002122122120120222
421122222130202322
5131201404323002
64351150020042
7505363114121
oct113252344272
928078576528
1010111011002
114319447244
121b621a7622
13c519b7a61
146bcbbcab8
153e29da1a2
hex25aa9c8ba

10111011002 has 8 divisors (see below), whose sum is σ = 15825930336. Its totient is φ = 4835700892.

The previous prime is 10111010993. The next prime is 10111011047. The reversal of 10111011002 is 20011011101.

It is a happy number.

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

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

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 in 3 ways as a sum of consecutive naturals, for example, 109902248 + ... + 109902339.

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

Almost surely, 210111011002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 219804612.

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 10111011002 its reverse (20011011101), we get a palindrome (30122022103).

Subtracting 10111011002 from its reverse (20011011101), we obtain a palindrome (9900000099).

The spelling of 10111011002 in words is "ten billion, one hundred eleven million, eleven thousand, two".

Divisors: 1 2 23 46 219804587 439609174 5055505501 10111011002