Search a number
-
+
12011200310 = 251201120031
BaseRepresentation
bin10110010111110110…
…00101111100110110
31011000002012012021202
423023323011330312
5144044331402220
65303505412502
7603435342464
oct131373057466
934002165252
1012011200310
11510401162a
1223b263a132
131195586825
1481d2d5834
154a4734275
hex2cbec5f36

12011200310 has 8 divisors (see below), whose sum is σ = 21620160576. Its totient is φ = 4804480120.

The previous prime is 12011200301. The next prime is 12011200373. The reversal of 12011200310 is 1300211021.

It is a sphenic number, since it is the product of 3 distinct primes.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 212011200310 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1201120038.

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

Adding to 12011200310 its reverse (1300211021), we get a palindrome (13311411331).

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

Divisors: 1 2 5 10 1201120031 2402240062 6005600155 12011200310