Base | Representation |
---|---|
bin | 10101000101101101… |
… | …10110101001101101 |
3 | 1002020001202112101111 |
4 | 22202312312221231 |
5 | 141141442120323 |
6 | 5111254312021 |
7 | 550401211060 |
oct | 124266665155 |
9 | 32201675344 |
10 | 11322223213 |
11 | 4890110974 |
12 | 223b958611 |
13 | 10b5906782 |
14 | 7959ca8d7 |
15 | 463edcc0d |
hex | 2a2db6a6d |
11322223213 has 4 divisors (see below), whose sum is σ = 12939683680. Its totient is φ = 9704762748.
The previous prime is 11322223201. The next prime is 11322223259. The reversal of 11322223213 is 31232222311.
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 11322223213 - 29 = 11322222701 is a prime.
It is a super-3 number, since 3×113222232133 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11322223613) 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, 808730223 + ... + 808730236.
It is an arithmetic number, because the mean of its divisors is an integer number (3234920920).
Almost surely, 211322223213 is an apocalyptic number.
It is an amenable number.
11322223213 is a deficient number, since it is larger than the sum of its proper divisors (1617460467).
11322223213 is an equidigital number, since it uses as much as digits as its factorization.
11322223213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1617460466.
The product of its digits is 864, while the sum is 22.
Adding to 11322223213 its reverse (31232222311), we get a palindrome (42554445524).
The spelling of 11322223213 in words is "eleven billion, three hundred twenty-two million, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •