Base | Representation |
---|---|
bin | 100101101001110011100001… |
… | …1111110011100001110011111 |
3 | 1121102200111221012010011201101 |
4 | 1023103213003332130032133 |
5 | 321402344323330201421 |
6 | 3132223404010453531 |
7 | 126522330015333325 |
oct | 11323470376341637 |
9 | 1542614835104641 |
10 | 331201101022111 |
11 | 9659266414a8a1 |
12 | 31190baa7342a7 |
13 | 112a618c279a28 |
14 | 5bb030c633d15 |
15 | 2845479d0c191 |
hex | 12d39c3f9c39f |
331201101022111 has 16 divisors (see below), whose sum is σ = 350851502351808. Its totient is φ = 311569381670400.
The previous prime is 331201101022061. The next prime is 331201101022171. The reversal of 331201101022111 is 111220101102133.
It is a cyclic number.
It is not a de Polignac number, because 331201101022111 - 29 = 331201101021599 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 (331201101022171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 639890641 + ... + 640408021.
It is an arithmetic number, because the mean of its divisors is an integer number (21928218896988).
Almost surely, 2331201101022111 is an apocalyptic number.
331201101022111 is a deficient number, since it is larger than the sum of its proper divisors (19650401329697).
331201101022111 is a wasteful number, since it uses less digits than its factorization.
331201101022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 535362.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 331201101022111 its reverse (111220101102133), we get a palindrome (442421202124244).
The spelling of 331201101022111 in words is "three hundred thirty-one trillion, two hundred one billion, one hundred one million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •