Base | Representation |
---|---|
bin | 1010111011001101000000… |
… | …1011000111001000010011 |
3 | 1120112100122100022000001021 |
4 | 2232303100023013020103 |
5 | 3033302012102231311 |
6 | 41314201015220311 |
7 | 2346566015642566 |
oct | 256632013071023 |
9 | 46470570260037 |
10 | 12012221133331 |
11 | 39113997431a1 |
12 | 1420070677697 |
13 | 6919945ca923 |
14 | 2d7574b204dd |
15 | 15c6eacc2171 |
hex | aecd02c7213 |
12012221133331 has 16 divisors (see below), whose sum is σ = 12971415340800. Its totient is φ = 11097766310400.
The previous prime is 12012221133323. The next prime is 12012221133343. The reversal of 12012221133331 is 13333112221021.
It is a cyclic number.
It is not a de Polignac number, because 12012221133331 - 23 = 12012221133323 is a prime.
It is a super-2 number, since 2×120122211333312 (a number of 27 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 = 12012221133296 and 12012221133305.
It is not an unprimeable number, because it can be changed into a prime (12012221133301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74986050 + ... + 75146071.
It is an arithmetic number, because the mean of its divisors is an integer number (810713458800).
Almost surely, 212012221133331 is an apocalyptic number.
12012221133331 is a deficient number, since it is larger than the sum of its proper divisors (959194207469).
12012221133331 is a wasteful number, since it uses less digits than its factorization.
12012221133331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150132270.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 12012221133331 its reverse (13333112221021), we get a palindrome (25345333354352).
The spelling of 12012221133331 in words is "twelve trillion, twelve billion, two hundred twenty-one million, one hundred thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •