Base | Representation |
---|---|
bin | 110011110011010101… |
… | …0010001010011100101 |
3 | 101122010210020220010111 |
4 | 1213212222101103211 |
5 | 3310311432214023 |
6 | 123034345253021 |
7 | 11015505410464 |
oct | 1474652212345 |
9 | 348123226114 |
10 | 111244023013 |
11 | 431a6395002 |
12 | 19687494171 |
13 | a64b1660b6 |
14 | 55544d29db |
15 | 2d6142c00d |
hex | 19e6a914e5 |
111244023013 has 8 divisors (see below), whose sum is σ = 111408815232. Its totient is φ = 111079336896.
The previous prime is 111244022999. The next prime is 111244023017. The reversal of 111244023013 is 310320442111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111244023013 is a prime.
It is a super-2 number, since 2×1112440230132 (a number of 23 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 (111244023017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2209506 + ... + 2259292.
It is an arithmetic number, because the mean of its divisors is an integer number (13926101904).
Almost surely, 2111244023013 is an apocalyptic number.
It is an amenable number.
111244023013 is a deficient number, since it is larger than the sum of its proper divisors (164792219).
111244023013 is an equidigital number, since it uses as much as digits as its factorization.
111244023013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53051.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 111244023013 its reverse (310320442111), we get a palindrome (421564465124).
The spelling of 111244023013 in words is "one hundred eleven billion, two hundred forty-four million, twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •