Search a number
-
+
12010200313 = 115271041919
BaseRepresentation
bin10110010111101110…
…10001110011111001
31011000000022101112211
423023313101303321
5144044102402223
65303432135121
7603424006156
oct131367216371
934000271484
1012010200313
115103499291
1223b22374a1
1311952c6607
1481d11522d
154a45d7d0d
hex2cbdd1cf9

12010200313 has 4 divisors (see below), whose sum is σ = 12011253760. Its totient is φ = 12009146868.

The previous prime is 12010200271. The next prime is 12010200353. The reversal of 12010200313 is 31300201021.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 12010200313 - 233 = 3420265721 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 509433 + ... + 532486.

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

Almost surely, 212010200313 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1053446.

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

Adding to 12010200313 its reverse (31300201021), we get a palindrome (43310401334).

The spelling of 12010200313 in words is "twelve billion, ten million, two hundred thousand, three hundred thirteen".

Divisors: 1 11527 1041919 12010200313