Search a number
-
+
102003200210 = 2561167218361
BaseRepresentation
bin101111011111111011…
…1010101000011010010
3100202021210000110100002
41132333313111003102
53132400304401320
6114505402330002
710240506616232
oct1367767250322
9322253013302
10102003200210
113a29416906a
12179287b9902
139807837602
144d1910dcc2
1529c0030675
hex17bfdd50d2

102003200210 has 16 divisors (see below), whose sum is σ = 186615691992. Its totient is φ = 40132406400.

The previous prime is 102003200183. The next prime is 102003200261. The reversal of 102003200210 is 12002300201.

It is a happy number.

It can be written as a sum of positive squares in 4 ways, for example, as 68377543081 + 33625657129 = 261491^2 + 183373^2 .

It is a junction number, because it is equal to n+sod(n) for n = 102003200191 and 102003200200.

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

Almost surely, 2102003200210 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 167218429.

The product of its (nonzero) digits is 24, while the sum is 11.

Adding to 102003200210 its reverse (12002300201), we get a palindrome (114005500411).

Subtracting from 102003200210 its reverse (12002300201), we obtain a palindrome (90000900009).

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

Divisors: 1 2 5 10 61 122 305 610 167218361 334436722 836091805 1672183610 10200320021 20400640042 51001600105 102003200210