Search a number
-
+
103010223213 = 3220115691487
BaseRepresentation
bin101111111101111100…
…0110100010001101101
3100211212221220112012100
41133323320310101231
53141431104120323
6115153334325313
710304455310322
oct1377370642155
9324787815170
10103010223213
113a760649387
1217b69ab9839
139938363301
144db2b68b49
152a2d64c943
hex17fbe3446d

103010223213 has 12 divisors (see below), whose sum is σ = 148866560128. Its totient is φ = 68639321160.

The previous prime is 103010223209. The next prime is 103010223221. The reversal of 103010223213 is 312322010301.

It is not a de Polignac number, because 103010223213 - 22 = 103010223209 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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 11 ways as a sum of consecutive naturals, for example, 2827645 + ... + 2863842.

Almost surely, 2103010223213 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 216, while the sum is 18.

Adding to 103010223213 its reverse (312322010301), we get a palindrome (415332233514).

The spelling of 103010223213 in words is "one hundred three billion, ten million, two hundred twenty-three thousand, two hundred thirteen".

Divisors: 1 3 9 2011 6033 18099 5691487 17074461 51223383 11445580357 34336741071 103010223213