Search a number
-
+
100011010002 = 2316668501667
BaseRepresentation
bin101110100100100011…
…1101110011111010010
3100120010221100201010120
41131021013232133102
53114310304310002
6113535555011110
710140236362431
oct1351107563722
9316127321116
10100011010002
1139461676082
1217471599a96
13957ab95c37
144baa6c9118
1529051b1cbc
hex17491ee7d2

100011010002 has 8 divisors (see below), whose sum is σ = 200022020016. Its totient is φ = 33337003332.

The previous prime is 100011009997. The next prime is 100011010031. The reversal of 100011010002 is 200010110001.

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

100011010002 is an admirable number.

It is a Harshad number since it is a multiple of its sum of digits (6), and also a Moran number because the ratio is a prime number: 16668501667 = 100011010002 / (1 + 0 + 0 + 0 + 1 + 1 + 0 + 1 + 0 + 0 + 0 + 2).

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, 8334250828 + ... + 8334250839.

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

Almost surely, 2100011010002 is an apocalyptic number.

100011010002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 16668501672.

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

Adding to 100011010002 its reverse (200010110001), we get a palindrome (300021120003).

Subtracting 100011010002 from its reverse (200010110001), we obtain a palindrome (99999099999).

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

Divisors: 1 2 3 6 16668501667 33337003334 50005505001 100011010002