Base | Representation |
---|---|
bin | 10100101011001111… |
… | …11111011011101101 |
3 | 1001122121000202122021 |
4 | 22111213333123231 |
5 | 140213124120323 |
6 | 5033244150141 |
7 | 542034224542 |
oct | 122547773355 |
9 | 31577022567 |
10 | 11100223213 |
11 | 4786871aa2 |
12 | 2199538351 |
13 | 107b918921 |
14 | 77431cbc9 |
15 | 44e78a05d |
hex | 2959ff6ed |
11100223213 has 4 divisors (see below), whose sum is σ = 11100541788. Its totient is φ = 11099904640.
The previous prime is 11100223181. The next prime is 11100223217. The reversal of 11100223213 is 31232200111.
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 9638919684 + 1461303529 = 98178^2 + 38227^2 .
It is a cyclic number.
It is not a de Polignac number, because 11100223213 - 25 = 11100223181 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 (11100223217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99556 + ... + 179197.
It is an arithmetic number, because the mean of its divisors is an integer number (2775135447).
Almost surely, 211100223213 is an apocalyptic number.
It is an amenable number.
11100223213 is a deficient number, since it is larger than the sum of its proper divisors (318575).
11100223213 is an equidigital number, since it uses as much as digits as its factorization.
11100223213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318574.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 11100223213 its reverse (31232200111), we get a palindrome (42332423324).
The spelling of 11100223213 in words is "eleven billion, one hundred million, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •