Base | Representation |
---|---|
bin | 1010111011101010000101… |
… | …1101100101100101010111 |
3 | 1120120002210101010112020011 |
4 | 2232322201131211211113 |
5 | 3033414004002211403 |
6 | 41321531354221051 |
7 | 2350263324652426 |
oct | 256724135454527 |
9 | 46502711115204 |
10 | 12020027382103 |
11 | 3914735106464 |
12 | 142168aa24787 |
13 | 692639963a40 |
14 | 2d7ab57912bd |
15 | 15ca06299a6d |
hex | aeea1765957 |
12020027382103 has 8 divisors (see below), whose sum is σ = 13220062849728. Its totient is φ = 10859337339744.
The previous prime is 12020027382067. The next prime is 12020027382107. The reversal of 12020027382103 is 30128372002021.
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 12020027382103 - 217 = 12020027251031 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12020027382107) 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, 9836355676 + ... + 9836356897.
It is an arithmetic number, because the mean of its divisors is an integer number (1652507856216).
Almost surely, 212020027382103 is an apocalyptic number.
12020027382103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12020027382103 is a deficient number, since it is larger than the sum of its proper divisors (1200035467625).
12020027382103 is a wasteful number, since it uses less digits than its factorization.
12020027382103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19672712633.
The product of its (nonzero) digits is 8064, while the sum is 31.
Adding to 12020027382103 its reverse (30128372002021), we get a palindrome (42148399384124).
The spelling of 12020027382103 in words is "twelve trillion, twenty billion, twenty-seven million, three hundred eighty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •