Base | Representation |
---|---|
bin | 10110101110101101… |
… | …10011001110100111 |
3 | 1011111110010021212121 |
4 | 23113112303032213 |
5 | 144442432404111 |
6 | 5334520530411 |
7 | 611254620316 |
oct | 132726631647 |
9 | 34443107777 |
10 | 12203013031 |
11 | 51a2312340 |
12 | 2446920a07 |
13 | 11c6235391 |
14 | 83a98627d |
15 | 4b64c2871 |
hex | 2d75b33a7 |
12203013031 has 8 divisors (see below), whose sum is σ = 13672172304. Its totient is φ = 10793819520.
The previous prime is 12203013023. The next prime is 12203013089. The reversal of 12203013031 is 13031030221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12203013031 - 23 = 12203013023 is a prime.
It is a super-2 number, since 2×122030130312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12203012996 and 12203013014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12203017031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14991010 + ... + 14991823.
It is an arithmetic number, because the mean of its divisors is an integer number (1709021538).
Almost surely, 212203013031 is an apocalyptic number.
12203013031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12203013031 is a deficient number, since it is larger than the sum of its proper divisors (1469159273).
12203013031 is a wasteful number, since it uses less digits than its factorization.
12203013031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29982881.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 12203013031 its reverse (13031030221), we get a palindrome (25234043252).
The spelling of 12203013031 in words is "twelve billion, two hundred three million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •