Base | Representation |
---|---|
bin | 11001010011110100100000… |
… | …011010011011111000100110 |
3 | 112121010102212002010022020112 |
4 | 121103310200122123320212 |
5 | 104042223424032230202 |
6 | 1032424325553333022 |
7 | 32306054066606252 |
oct | 3123644032337046 |
9 | 477112762108215 |
10 | 111313211211302 |
11 | 32516738887a31 |
12 | 105992b5267172 |
13 | 4a15a3844b899 |
14 | 1d6b833d15262 |
15 | cd07a33aab52 |
hex | 653d2069be26 |
111313211211302 has 16 divisors (see below), whose sum is σ = 184478160781152. Its totient is φ = 50105179470720.
The previous prime is 111313211211289. The next prime is 111313211211337. The reversal of 111313211211302 is 203112112313111.
111313211211302 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is an unprimeable number.
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, 71172129149 + ... + 71172130712.
It is an arithmetic number, because the mean of its divisors is an integer number (11529885048822).
Almost surely, 2111313211211302 is an apocalyptic number.
111313211211302 is a deficient number, since it is larger than the sum of its proper divisors (73164949569850).
111313211211302 is a wasteful number, since it uses less digits than its factorization.
111313211211302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142344259903.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 111313211211302 its reverse (203112112313111), we get a palindrome (314425323524413).
The spelling of 111313211211302 in words is "one hundred eleven trillion, three hundred thirteen billion, two hundred eleven million, two hundred eleven thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •