Base | Representation |
---|---|
bin | 11001001111010001111011… |
… | …101100101010000011111101 |
3 | 112120000121112011222202111012 |
4 | 121033101323230222003331 |
5 | 104022120434241231023 |
6 | 1032025130231005005 |
7 | 32244400315130030 |
oct | 3117217354520375 |
9 | 476017464882435 |
10 | 111001210102013 |
11 | 324063923416a0 |
12 | 10548940809765 |
13 | 49c24a518a59a |
14 | 1d5a6b6d87017 |
15 | cc75e230c978 |
hex | 64f47bb2a0fd |
111001210102013 has 64 divisors (see below), whose sum is σ = 141228637655040. Its totient is φ = 84731403033600.
The previous prime is 111001210101989. The next prime is 111001210102067. The reversal of 111001210102013 is 310201012100111.
It is a cyclic number.
It is not a de Polignac number, because 111001210102013 - 224 = 111001193324797 is a prime.
It is a super-2 number, since 2×1110012101020132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111001210102093) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6381938645 + ... + 6381956037.
It is an arithmetic number, because the mean of its divisors is an integer number (2206697463360).
Almost surely, 2111001210102013 is an apocalyptic number.
It is an amenable number.
111001210102013 is a deficient number, since it is larger than the sum of its proper divisors (30227427553027).
111001210102013 is a wasteful number, since it uses less digits than its factorization.
111001210102013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22298.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 111001210102013 its reverse (310201012100111), we get a palindrome (421202222202124).
The spelling of 111001210102013 in words is "one hundred eleven trillion, one billion, two hundred ten million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •