Base | Representation |
---|---|
bin | 10101000101110100… |
… | …01100110010101101 |
3 | 1002020010102002120102 |
4 | 22202322030302231 |
5 | 141142203202313 |
6 | 5111325200445 |
7 | 550411523216 |
oct | 124272146255 |
9 | 32203362512 |
10 | 11323100333 |
11 | 489065a966 |
12 | 2240100125 |
13 | 10b5b52a8c |
14 | 795b7840d |
15 | 464112a58 |
hex | 2a2e8ccad |
11323100333 has 2 divisors, whose sum is σ = 11323100334. Its totient is φ = 11323100332.
The previous prime is 11323100323. The next prime is 11323100351. The reversal of 11323100333 is 33300132311.
11323100333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6786134884 + 4536965449 = 82378^2 + 67357^2 .
It is a cyclic number.
It is not a de Polignac number, because 11323100333 - 212 = 11323096237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11323100323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5661550166 + 5661550167.
It is an arithmetic number, because the mean of its divisors is an integer number (5661550167).
Almost surely, 211323100333 is an apocalyptic number.
It is an amenable number.
11323100333 is a deficient number, since it is larger than the sum of its proper divisors (1).
11323100333 is an equidigital number, since it uses as much as digits as its factorization.
11323100333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 11323100333 its reverse (33300132311), we get a palindrome (44623232644).
The spelling of 11323100333 in words is "eleven billion, three hundred twenty-three million, one hundred thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •