Base | Representation |
---|---|
bin | 10101000101101101… |
… | …10100001110111110 |
3 | 1002020001202000210201 |
4 | 22202312310032332 |
5 | 141141441311220 |
6 | 5111254154114 |
7 | 550401140152 |
oct | 124266641676 |
9 | 32201660721 |
10 | 11322213310 |
11 | 4890104491 |
12 | 223b95293a |
13 | 10b5902105 |
14 | 7959c7062 |
15 | 463ed9d0a |
hex | 2a2db43be |
11322213310 has 8 divisors (see below), whose sum is σ = 20379983976. Its totient is φ = 4528885320.
The previous prime is 11322213307. The next prime is 11322213317. The reversal of 11322213310 is 1331222311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×113222133102 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11322213317) 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, 566110656 + ... + 566110675.
It is an arithmetic number, because the mean of its divisors is an integer number (2547497997).
Almost surely, 211322213310 is an apocalyptic number.
11322213310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11322213310 is a deficient number, since it is larger than the sum of its proper divisors (9057770666).
11322213310 is a wasteful number, since it uses less digits than its factorization.
11322213310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1132221338.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 11322213310 its reverse (1331222311), we get a palindrome (12653435621).
Subtracting from 11322213310 its reverse (1331222311), we obtain a palindrome (9990990999).
The spelling of 11322213310 in words is "eleven billion, three hundred twenty-two million, two hundred thirteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •