Base | Representation |
---|---|
bin | 11001010101101010100101… |
… | …110010110011100110011101 |
3 | 112121120120010102021121102012 |
4 | 121111222211302303212131 |
5 | 104101313111233134323 |
6 | 1033002455230041005 |
7 | 32321163106322606 |
oct | 3125524562634635 |
9 | 477516112247365 |
10 | 111440003021213 |
11 | 3256549251a399 |
12 | 105b999b649165 |
13 | 4a24993777a89 |
14 | 1d73a212a2dad |
15 | cd3c24754678 |
hex | 655aa5cb399d |
111440003021213 has 4 divisors (see below), whose sum is σ = 111440698191648. Its totient is φ = 111439307850780.
The previous prime is 111440003021209. The next prime is 111440003021297. The reversal of 111440003021213 is 312120300044111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 111440003021213 - 22 = 111440003021209 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111440003021813) 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, 347344703 + ... + 347665388.
It is an arithmetic number, because the mean of its divisors is an integer number (27860174547912).
Almost surely, 2111440003021213 is an apocalyptic number.
It is an amenable number.
111440003021213 is a deficient number, since it is larger than the sum of its proper divisors (695170435).
111440003021213 is an equidigital number, since it uses as much as digits as its factorization.
111440003021213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 695170434.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 111440003021213 its reverse (312120300044111), we get a palindrome (423560303065324).
The spelling of 111440003021213 in words is "one hundred eleven trillion, four hundred forty billion, three million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •