Base | Representation |
---|---|
bin | 1011000001100011110010… |
… | …0100110110100110011111 |
3 | 1120220210111011221111220012 |
4 | 2300120330210312212133 |
5 | 3042044123441044403 |
6 | 41440300053313435 |
7 | 2360512640011646 |
oct | 260307444664637 |
9 | 46823434844805 |
10 | 12121414003103 |
11 | 3953732222429 |
12 | 143926503587b |
13 | 69c076819382 |
14 | 2dc972a4035d |
15 | 16048c0d4ed8 |
hex | b063c93699f |
12121414003103 has 4 divisors (see below), whose sum is σ = 12123641800128. Its totient is φ = 12119186206080.
The previous prime is 12121414003099. The next prime is 12121414003141. The reversal of 12121414003103 is 30130041412121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12121414003103 - 22 = 12121414003099 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 (12121414006103) 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 3 ways as a sum of consecutive naturals, for example, 1113890351 + ... + 1113901232.
It is an arithmetic number, because the mean of its divisors is an integer number (3030910450032).
Almost surely, 212121414003103 is an apocalyptic number.
12121414003103 is a deficient number, since it is larger than the sum of its proper divisors (2227797025).
12121414003103 is an equidigital number, since it uses as much as digits as its factorization.
12121414003103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2227797024.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 12121414003103 its reverse (30130041412121), we get a palindrome (42251455415224).
The spelling of 12121414003103 in words is "twelve trillion, one hundred twenty-one billion, four hundred fourteen million, three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •