Base | Representation |
---|---|
bin | 1010111011010000010010… |
… | …1000000010110110100101 |
3 | 1120112102220200011121221210 |
4 | 2232310010220002312211 |
5 | 3033310312342230341 |
6 | 41314424212502033 |
7 | 2346626562552126 |
oct | 256640450026645 |
9 | 46472820147853 |
10 | 12013101133221 |
11 | 3911800455131 |
12 | 142027731a919 |
13 | 691aa4a10b16 |
14 | 2d761995204d |
15 | 15c74d19cc16 |
hex | aed04a02da5 |
12013101133221 has 8 divisors (see below), whose sum is σ = 16022088170784. Its totient is φ = 8006424092240.
The previous prime is 12013101133219. The next prime is 12013101133337. The reversal of 12013101133221 is 12233110131021.
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 12013101133221 - 21 = 12013101133219 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12013101135221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 577487010 + ... + 577507811.
It is an arithmetic number, because the mean of its divisors is an integer number (2002761021348).
Almost surely, 212013101133221 is an apocalyptic number.
It is an amenable number.
12013101133221 is a deficient number, since it is larger than the sum of its proper divisors (4008987037563).
12013101133221 is a wasteful number, since it uses less digits than its factorization.
12013101133221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1154998291.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 12013101133221 its reverse (12233110131021), we get a palindrome (24246211264242).
The spelling of 12013101133221 in words is "twelve trillion, thirteen billion, one hundred one million, one hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •