Base | Representation |
---|---|
bin | 1010111010100011001101… |
… | …1010100010101111110111 |
3 | 1120111021200102001101221211 |
4 | 2232220303122202233313 |
5 | 3033111022303033421 |
6 | 41305103413422251 |
7 | 2346020666160340 |
oct | 256506332425767 |
9 | 46437612041854 |
10 | 12001001221111 |
11 | 3907661362071 |
12 | 1419a5b03a987 |
13 | 6908c6c66806 |
14 | 2d6bcc9670c7 |
15 | 15c290c939e1 |
hex | aea336a2bf7 |
12001001221111 has 16 divisors (see below), whose sum is σ = 14014276614144. Its totient is φ = 10062657146304.
The previous prime is 12001001221109. The next prime is 12001001221133. The reversal of 12001001221111 is 11112210010021.
It is a happy number.
It is not a de Polignac number, because 12001001221111 - 21 = 12001001221109 is a prime.
It is a super-2 number, since 2×120010012211112 (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 = 12001001221091 and 12001001221100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001001221211) 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, 8495635 + ... + 9807028.
It is an arithmetic number, because the mean of its divisors is an integer number (875892288384).
Almost surely, 212001001221111 is an apocalyptic number.
12001001221111 is a deficient number, since it is larger than the sum of its proper divisors (2013275393033).
12001001221111 is a wasteful number, since it uses less digits than its factorization.
12001001221111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18304710.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12001001221111 its reverse (11112210010021), we get a palindrome (23113211231132).
The spelling of 12001001221111 in words is "twelve trillion, one billion, one million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •