Base | Representation |
---|---|
bin | 11001001111010010000011… |
… | …000101110010110110100110 |
3 | 112120000121211211101010211101 |
4 | 121033102003011302312212 |
5 | 104022121213014212014 |
6 | 1032025150421230314 |
7 | 32244403352304625 |
oct | 3117220305626646 |
9 | 476017754333741 |
10 | 111001334132134 |
11 | 32406446356326 |
12 | 1054897626239a |
13 | 49c24c4a959a4 |
14 | 1d5a6c96316bc |
15 | cc75ed15c474 |
hex | 64f483172da6 |
111001334132134 has 4 divisors (see below), whose sum is σ = 166502001198204. Its totient is φ = 55500667066066.
The previous prime is 111001334132131. The next prime is 111001334132149. The reversal of 111001334132134 is 431231433100111.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1110013341321342 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111001334132131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27750333533032 + ... + 27750333533035.
It is an arithmetic number, because the mean of its divisors is an integer number (41625500299551).
Almost surely, 2111001334132134 is an apocalyptic number.
111001334132134 is a deficient number, since it is larger than the sum of its proper divisors (55500667066070).
111001334132134 is an equidigital number, since it uses as much as digits as its factorization.
111001334132134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55500667066069.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 111001334132134 its reverse (431231433100111), we get a palindrome (542232767232245).
The spelling of 111001334132134 in words is "one hundred eleven trillion, one billion, three hundred thirty-four million, one hundred thirty-two thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •