Base | Representation |
---|---|
bin | 110011111000000001… |
… | …0010111000100011111 |
3 | 101122112202021001220011 |
4 | 1213300002113010133 |
5 | 3311122220124043 |
6 | 123102125104051 |
7 | 11022425464321 |
oct | 1476002270437 |
9 | 348482231804 |
10 | 111401333023 |
11 | 4327716a382 |
12 | 197100b8027 |
13 | a674924346 |
14 | 556b361611 |
15 | 2d7015259d |
hex | 19f009711f |
111401333023 has 4 divisors (see below), whose sum is σ = 111434660128. Its totient is φ = 111368005920.
The previous prime is 111401333009. The next prime is 111401333039. The reversal of 111401333023 is 320333104111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320333104111 = 103 ⋅3110030137.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111401333023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111401332985 and 111401333003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111401330023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16658538 + ... + 16665223.
It is an arithmetic number, because the mean of its divisors is an integer number (27858665032).
Almost surely, 2111401333023 is an apocalyptic number.
111401333023 is a deficient number, since it is larger than the sum of its proper divisors (33327105).
111401333023 is an equidigital number, since it uses as much as digits as its factorization.
111401333023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33327104.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 111401333023 its reverse (320333104111), we get a palindrome (431734437134).
The spelling of 111401333023 in words is "one hundred eleven billion, four hundred one million, three hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •