Base | Representation |
---|---|
bin | 10101000100100111… |
… | …01101101010000101 |
3 | 1002012102102112001202 |
4 | 22202103231222011 |
5 | 141132112330313 |
6 | 5110325032245 |
7 | 550230003221 |
oct | 124223555205 |
9 | 32172375052 |
10 | 11313011333 |
11 | 4885999948 |
12 | 2238855685 |
13 | 10b3a2c860 |
14 | 7946ad781 |
15 | 4632bd558 |
hex | 2a24eda85 |
11313011333 has 4 divisors (see below), whose sum is σ = 12183242988. Its totient is φ = 10442779680.
The previous prime is 11313011323. The next prime is 11313011377. The reversal of 11313011333 is 33311031311.
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 3278936644 + 8034074689 = 57262^2 + 89633^2 .
It is a cyclic number.
It is not a de Polignac number, because 11313011333 - 216 = 11312945797 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 (11313011323) 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, 435115808 + ... + 435115833.
It is an arithmetic number, because the mean of its divisors is an integer number (3045810747).
Almost surely, 211313011333 is an apocalyptic number.
11313011333 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11313011333 is a deficient number, since it is larger than the sum of its proper divisors (870231655).
11313011333 is an equidigital number, since it uses as much as digits as its factorization.
11313011333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 870231654.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 11313011333 its reverse (33311031311), we get a palindrome (44624042644).
The spelling of 11313011333 in words is "eleven billion, three hundred thirteen million, eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •