Search a number
-
+
101000010010 = 2510100001001
BaseRepresentation
bin101111000010000010…
…0011101100100011010
3100122200212100010002111
41132010010131210122
53123322000310020
6114222044422534
710203605630404
oct1360404354432
9318625303074
10101000010010
1139919966459
12176a8847a4a
1396a7a51343
144c61bb1b74
152961e1dd5a
hex178411d91a

101000010010 has 8 divisors (see below), whose sum is σ = 181800018036. Its totient is φ = 40400004000.

The previous prime is 101000009983. The next prime is 101000010017. The reversal of 101000010010 is 10010000101.

It can be written as a sum of positive squares in 2 ways, for example, as 91550420329 + 9449589681 = 302573^2 + 97209^2 .

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

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

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

Almost surely, 2101000010010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10100001008.

The product of its (nonzero) digits is 1, while the sum is 4.

Adding to 101000010010 its reverse (10010000101), we get a palindrome (111010010111).

Subtracting from 101000010010 its reverse (10010000101), we obtain a palindrome (90990009909).

The spelling of 101000010010 in words is "one hundred one billion, ten thousand, ten".

Divisors: 1 2 5 10 10100001001 20200002002 50500005005 101000010010