Base | Representation |
---|---|
bin | 1010010011100011101011… |
… | …1010110110010010110001 |
3 | 1111010020120200201212001121 |
4 | 2210320322322312102301 |
5 | 2441122104212411423 |
6 | 40033235135502241 |
7 | 2246434344545032 |
oct | 244707272662261 |
9 | 44106520655047 |
10 | 11331112232113 |
11 | 36795524a9733 |
12 | 1330066687981 |
13 | 642699b8c25b |
14 | 2b2600726a89 |
15 | 149b3544245d |
hex | a4e3aeb64b1 |
11331112232113 has 8 divisors (see below), whose sum is σ = 11696721541376. Its totient is φ = 10965508520400.
The previous prime is 11331112232093. The next prime is 11331112232117. The reversal of 11331112232113 is 31123221113311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11331112232113 - 25 = 11331112232081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11331112232117) 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, 2926870 + ... + 5588272.
It is an arithmetic number, because the mean of its divisors is an integer number (1462090192672).
Almost surely, 211331112232113 is an apocalyptic number.
It is an amenable number.
11331112232113 is a deficient number, since it is larger than the sum of its proper divisors (365609309263).
11331112232113 is a wasteful number, since it uses less digits than its factorization.
11331112232113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2798775.
The product of its digits is 648, while the sum is 25.
Adding to 11331112232113 its reverse (31123221113311), we get a palindrome (42454333345424).
The spelling of 11331112232113 in words is "eleven trillion, three hundred thirty-one billion, one hundred twelve million, two hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •