Base | Representation |
---|---|
bin | 10110101110010110… |
… | …11011001101111111 |
3 | 1011111020111210102211 |
4 | 23113023123031333 |
5 | 144441201443403 |
6 | 5334333001251 |
7 | 611220360541 |
oct | 132713331577 |
9 | 34436453384 |
10 | 12200031103 |
11 | 51a0665a37 |
12 | 2445923227 |
13 | 11c5730020 |
14 | 83a40b691 |
15 | 4b60d406d |
hex | 2d72db37f |
12200031103 has 8 divisors (see below), whose sum is σ = 13214442528. Its totient is φ = 11196469344.
The previous prime is 12200031097. The next prime is 12200031133. The reversal of 12200031103 is 30113000221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12200031103 - 25 = 12200031071 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200031133) 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 7 ways as a sum of consecutive naturals, for example, 2710075 + ... + 2714572.
It is an arithmetic number, because the mean of its divisors is an integer number (1651805316).
Almost surely, 212200031103 is an apocalyptic number.
12200031103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12200031103 is a deficient number, since it is larger than the sum of its proper divisors (1014411425).
12200031103 is a wasteful number, since it uses less digits than its factorization.
12200031103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5424833.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 12200031103 its reverse (30113000221), we get a palindrome (42313031324).
The spelling of 12200031103 in words is "twelve billion, two hundred million, thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •