Base | Representation |
---|---|
bin | 11001010000111001001111… |
… | …000010111000000000111111 |
3 | 112120102012211101112112122100 |
4 | 121100321033002320000333 |
5 | 104030430120301220221 |
6 | 1032152112523320143 |
7 | 32255405110433133 |
oct | 3120711702700077 |
9 | 476365741475570 |
10 | 111112130101311 |
11 | 324494318338a9 |
12 | 10566337680053 |
13 | 49ccaa1163b71 |
14 | 1d61bda4113c3 |
15 | cca435082926 |
hex | 650e4f0b803f |
111112130101311 has 48 divisors (see below), whose sum is σ = 162164335132800. Its totient is φ = 73306126281024.
The previous prime is 111112130101279. The next prime is 111112130101363. The reversal of 111112130101311 is 113101031211111.
It is a happy number.
111112130101311 is a `hidden beast` number, since 1 + 11 + 112 + 130 + 101 + 311 = 666.
It is not a de Polignac number, because 111112130101311 - 25 = 111112130101279 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111112130106311) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3422293500 + ... + 3422325966.
It is an arithmetic number, because the mean of its divisors is an integer number (3378423648600).
Almost surely, 2111112130101311 is an apocalyptic number.
111112130101311 is a deficient number, since it is larger than the sum of its proper divisors (51052205031489).
111112130101311 is a wasteful number, since it uses less digits than its factorization.
111112130101311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36708 (or 36705 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 18.
Adding to 111112130101311 its reverse (113101031211111), we get a palindrome (224213161312422).
The spelling of 111112130101311 in words is "one hundred eleven trillion, one hundred twelve billion, one hundred thirty million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •