Search a number
-
+
102010022222002 = 251005011111001
BaseRepresentation
bin10111001100011100001111…
…001000110101100010110010
3111101012001200211202000020021
4113030130033020311202302
5101332313011142101002
61000542431322434054
730325660306134406
oct2714341710654262
9441161624660207
10102010022222002
112a55a23116a764
12b53628606292a
1344bc671b7839b
141b2945076b106
15bbd7ac599737
hex5cc70f2358b2

102010022222002 has 4 divisors (see below), whose sum is σ = 153015033333006. Its totient is φ = 51005011111000.

The previous prime is 102010022221997. The next prime is 102010022222027. The reversal of 102010022222002 is 200222220010201.

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

It can be written as a sum of positive squares in only one way, i.e., 101790725761321 + 219296460681 = 10089139^2 + 468291^2 .

It is an unprimeable number.

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

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

Almost surely, 2102010022222002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 51005011111003.

The product of its (nonzero) digits is 128, while the sum is 16.

Adding to 102010022222002 its reverse (200222220010201), we get a palindrome (302232242232203).

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

Divisors: 1 2 51005011111001 102010022222002