Search a number
-
+
1010100100102 = 2505050050051
BaseRepresentation
bin11101011001011101010…
…10000101110000000110
310120120020121112200010121
432230232222011300012
5113022141111200402
62052011130412154
7132656136121012
oct16545652056006
93516217480117
101010100100102
1135a42119a665
1214392059105a
1374337933232
1436c639c5542
151b41d2e8837
hexeb2ea85c06

1010100100102 has 4 divisors (see below), whose sum is σ = 1515150150156. Its totient is φ = 505050050050.

The previous prime is 1010100100081. The next prime is 1010100100109. The reversal of 1010100100102 is 2010010010101.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21010100100102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 505050050053.

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

Adding to 1010100100102 its reverse (2010010010101), we get a palindrome (3020110110203).

Subtracting 1010100100102 from its reverse (2010010010101), we obtain a palindrome (999909909999).

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

Divisors: 1 2 505050050051 1010100100102