Base | Representation |
---|---|
bin | 11001010011101001001001… |
… | …111100001101111110101011 |
3 | 112121002021101122220121100002 |
4 | 121103221021330031332223 |
5 | 104042023443343444321 |
6 | 1032414552322333215 |
7 | 32305143052024436 |
oct | 3123511174157653 |
9 | 477067348817302 |
10 | 111301023031211 |
11 | 32511553986922 |
12 | 10596a734ba20b |
13 | 4a1484530aac0 |
14 | 1d6add931081d |
15 | cd02dd36820b |
hex | 653a49f0dfab |
111301023031211 has 8 divisors (see below), whose sum is σ = 119868315528864. Its totient is φ = 102734541296640.
The previous prime is 111301023031207. The next prime is 111301023031213. The reversal of 111301023031211 is 112130320103111.
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 111301023031211 - 22 = 111301023031207 is a prime.
It is a super-2 number, since 2×1113010230312112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111301023031213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 202405631 + ... + 202954776.
It is an arithmetic number, because the mean of its divisors is an integer number (14983539441108).
Almost surely, 2111301023031211 is an apocalyptic number.
111301023031211 is a deficient number, since it is larger than the sum of its proper divisors (8567292497653).
111301023031211 is a wasteful number, since it uses less digits than its factorization.
111301023031211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405381541.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 111301023031211 its reverse (112130320103111), we get a palindrome (223431343134322).
The spelling of 111301023031211 in words is "one hundred eleven trillion, three hundred one billion, twenty-three million, thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •