Base | Representation |
---|---|
bin | 10100101100011011… |
… | …10010100111110101 |
3 | 1001200021200012020021 |
4 | 22112031302213311 |
5 | 140223143212323 |
6 | 5034240405141 |
7 | 542214365005 |
oct | 122615624765 |
9 | 31607605207 |
10 | 11110132213 |
11 | 479141a854 |
12 | 21a09167b1 |
13 | 10809a7c3b |
14 | 77577c005 |
15 | 45059605d |
hex | 2963729f5 |
11110132213 has 4 divisors (see below), whose sum is σ = 11763669420. Its totient is φ = 10456595008.
The previous prime is 11110132199. The next prime is 11110132237. The reversal of 11110132213 is 31223101111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2991761809 + 8118370404 = 54697^2 + 90102^2 .
It is not a de Polignac number, because 11110132213 - 29 = 11110131701 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 (11110132273) 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 3 ways as a sum of consecutive naturals, for example, 326768578 + ... + 326768611.
It is an arithmetic number, because the mean of its divisors is an integer number (2940917355).
Almost surely, 211110132213 is an apocalyptic number.
It is an amenable number.
11110132213 is a deficient number, since it is larger than the sum of its proper divisors (653537207).
11110132213 is an equidigital number, since it uses as much as digits as its factorization.
11110132213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 653537206.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11110132213 its reverse (31223101111), we get a palindrome (42333233324).
The spelling of 11110132213 in words is "eleven billion, one hundred ten million, one hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •