Base | Representation |
---|---|
bin | 10111000011110001010111… |
… | …001101101100111111100111 |
3 | 111022002002212010110012000212 |
4 | 113003301113031230333213 |
5 | 101243032321114044421 |
6 | 555405015441130035 |
7 | 30234636120262265 |
oct | 2703612715547747 |
9 | 438062763405025 |
10 | 101414231003111 |
11 | 2a34a5965a0764 |
12 | b45a91092991b |
13 | 447842317c700 |
14 | 1b08691467435 |
15 | bad03be92e5b |
hex | 5c3c5736cfe7 |
101414231003111 has 24 divisors (see below), whose sum is σ = 117190692601344. Its totient is φ = 87412729098240.
The previous prime is 101414231003093. The next prime is 101414231003171. The reversal of 101414231003111 is 111300132414101.
It is a de Polignac number, because none of the positive numbers 2k-101414231003111 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 (101414231003171) 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 23 ways as a sum of consecutive naturals, for example, 138607850 + ... + 139337591.
It is an arithmetic number, because the mean of its divisors is an integer number (4882945525056).
Almost surely, 2101414231003111 is an apocalyptic number.
101414231003111 is a deficient number, since it is larger than the sum of its proper divisors (15776461598233).
101414231003111 is a wasteful number, since it uses less digits than its factorization.
101414231003111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277945611 (or 277945598 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 101414231003111 its reverse (111300132414101), we get a palindrome (212714363417212).
The spelling of 101414231003111 in words is "one hundred one trillion, four hundred fourteen billion, two hundred thirty-one million, three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •