Base | Representation |
---|---|
bin | 11001010100000101001100… |
… | …011101001100111010111100 |
3 | 112121012011002212111020121012 |
4 | 121110011030131030322330 |
5 | 104043022123240100012 |
6 | 1032440452015254352 |
7 | 32310260121043664 |
oct | 3124051435147274 |
9 | 477164085436535 |
10 | 111331130003132 |
11 | 325232a35434a6 |
12 | 105a087621a3b8 |
13 | 4a176328b7ba0 |
14 | 1d6c653a431a4 |
15 | cd0ea1572622 |
hex | 65414c74cebc |
111331130003132 has 24 divisors (see below), whose sum is σ = 209835472165200. Its totient is φ = 51378918028416.
The previous prime is 111331130003131. The next prime is 111331130003147. The reversal of 111331130003132 is 231300031133111.
It is a junction number, because it is equal to n+sod(n) for n = 111331130003098 and 111331130003107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111331130003131) 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 in 7 ways as a sum of consecutive naturals, for example, 96932657 + ... + 98074472.
It is an arithmetic number, because the mean of its divisors is an integer number (8743144673550).
Almost surely, 2111331130003132 is an apocalyptic number.
It is an amenable number.
111331130003132 is a deficient number, since it is larger than the sum of its proper divisors (98504342162068).
111331130003132 is a wasteful number, since it uses less digits than its factorization.
111331130003132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195018125 (or 195018123 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 111331130003132 its reverse (231300031133111), we get a palindrome (342631161136243).
The spelling of 111331130003132 in words is "one hundred eleven trillion, three hundred thirty-one billion, one hundred thirty million, three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •