Search a number
-
+
103020002212 = 2225755000553
BaseRepresentation
bin101111111110001111…
…0000111101110100100
3100211220122022100110111
41133330132013232210
53141441110032322
6115154324102404
710304634366451
oct1377436075644
9324818270414
10103020002212
113a7661184a6
1217b71234a04
13993a3a83ba
144db4192828
152a2e430177
hex17fc787ba4

103020002212 has 6 divisors (see below), whose sum is σ = 180285003878. Its totient is φ = 51510001104.

The previous prime is 103020002161. The next prime is 103020002233. The reversal of 103020002212 is 212200020301.

It can be written as a sum of positive squares in only one way, i.e., 87016740196 + 16003262016 = 294986^2 + 126504^2 .

It is a super-2 number, since 2×1030200022122 (a number of 23 digits) contains 22 as substring.

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

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, 12877500273 + ... + 12877500280.

Almost surely, 2103020002212 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 25755000557 (or 25755000555 counting only the distinct ones).

The product of its (nonzero) digits is 48, while the sum is 13.

Adding to 103020002212 its reverse (212200020301), we get a palindrome (315220022513).

The spelling of 103020002212 in words is "one hundred three billion, twenty million, two thousand, two hundred twelve".

Divisors: 1 2 4 25755000553 51510001106 103020002212