Base | Representation |
---|---|
bin | 1001011111110011111011… |
… | …1011101010011001001111 |
3 | 1100222020221101111120221100 |
4 | 2113330332323222121033 |
5 | 2332040431024332421 |
6 | 34113013323234143 |
7 | 2125263333525441 |
oct | 227747673523117 |
9 | 40866841446840 |
10 | 10442121324111 |
11 | 336652a297684 |
12 | 1207905378953 |
13 | 5a98c3191c89 |
14 | 2815894da491 |
15 | 13195469dc26 |
hex | 97f3eeea64f |
10442121324111 has 6 divisors (see below), whose sum is σ = 15083064134840. Its totient is φ = 6961414216068.
The previous prime is 10442121324083. The next prime is 10442121324137. The reversal of 10442121324111 is 11142312124401.
10442121324111 is a `hidden beast` number, since 1 + 0 + 4 + 4 + 212 + 1 + 32 + 411 + 1 = 666.
It is not a de Polignac number, because 10442121324111 - 213 = 10442121315919 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 (10442121324211) 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 5 ways as a sum of consecutive naturals, for example, 580117851331 + ... + 580117851348.
Almost surely, 210442121324111 is an apocalyptic number.
10442121324111 is a deficient number, since it is larger than the sum of its proper divisors (4640942810729).
10442121324111 is a wasteful number, since it uses less digits than its factorization.
10442121324111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1160235702685 (or 1160235702682 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 10442121324111 its reverse (11142312124401), we get a palindrome (21584433448512).
The spelling of 10442121324111 in words is "ten trillion, four hundred forty-two billion, one hundred twenty-one million, three hundred twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •