Base | Representation |
---|---|
bin | 10100101100011011… |
… | …10001011001101101 |
3 | 1001200021122221101002 |
4 | 22112031301121231 |
5 | 140223143032323 |
6 | 5034240330045 |
7 | 542214344303 |
oct | 122615613155 |
9 | 31607587332 |
10 | 11110127213 |
11 | 4791417019 |
12 | 21a0913925 |
13 | 10809a5893 |
14 | 77577a273 |
15 | 450594828 |
hex | 29637166d |
11110127213 has 4 divisors (see below), whose sum is σ = 11292260508. Its totient is φ = 10927993920.
The previous prime is 11110127201. The next prime is 11110127243. The reversal of 11110127213 is 31272101111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31272101111 = 1733 ⋅18045067.
It can be written as a sum of positive squares in 2 ways, for example, as 109893289 + 11000233924 = 10483^2 + 104882^2 .
It is a cyclic number.
It is not a de Polignac number, because 11110127213 - 218 = 11109865069 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 (11110127243) 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, 91066556 + ... + 91066677.
It is an arithmetic number, because the mean of its divisors is an integer number (2823065127).
Almost surely, 211110127213 is an apocalyptic number.
It is an amenable number.
11110127213 is a deficient number, since it is larger than the sum of its proper divisors (182133295).
11110127213 is an equidigital number, since it uses as much as digits as its factorization.
11110127213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182133294.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 11110127213 its reverse (31272101111), we get a palindrome (42382228324).
The spelling of 11110127213 in words is "eleven billion, one hundred ten million, one hundred twenty-seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •