Base | Representation |
---|---|
bin | 110011110101010011… |
… | …0000010100101011001 |
3 | 101122022101110001002111 |
4 | 1213222212002211121 |
5 | 3310430331214001 |
6 | 123045104032321 |
7 | 11020236404332 |
oct | 1475246024531 |
9 | 348271401074 |
10 | 111310023001 |
11 | 4322a673851 |
12 | 196a56026a1 |
13 | a65ba34048 |
14 | 555d193289 |
15 | 2d67117851 |
hex | 19ea982959 |
111310023001 has 4 divisors (see below), whose sum is σ = 111313232100. Its totient is φ = 111306813904.
The previous prime is 111310022927. The next prime is 111310023031. The reversal of 111310023001 is 100320013111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100320013111 = 887 ⋅113100353.
It can be written as a sum of positive squares in 2 ways, for example, as 54702193225 + 56607829776 = 233885^2 + 237924^2 .
It is a cyclic number.
It is not a de Polignac number, because 111310023001 - 29 = 111310022489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111310023031) 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, 1551946 + ... + 1622083.
It is an arithmetic number, because the mean of its divisors is an integer number (27828308025).
Almost surely, 2111310023001 is an apocalyptic number.
It is an amenable number.
111310023001 is a deficient number, since it is larger than the sum of its proper divisors (3209099).
111310023001 is an equidigital number, since it uses as much as digits as its factorization.
111310023001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3209098.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 111310023001 its reverse (100320013111), we get a palindrome (211630036112).
The spelling of 111310023001 in words is "one hundred eleven billion, three hundred ten million, twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •