Base | Representation |
---|---|
bin | 10100100011001000… |
… | …01000010110110001 |
3 | 1001110211211212100021 |
4 | 22101210020112301 |
5 | 140043204233241 |
6 | 5022412123441 |
7 | 540246215422 |
oct | 122144102661 |
9 | 31424755307 |
10 | 11032102321 |
11 | 4751374839 |
12 | 217a766581 |
13 | 106a7874c6 |
14 | 769269649 |
15 | 4487d10d1 |
hex | 2919085b1 |
11032102321 has 4 divisors (see below), whose sum is σ = 11032654912. Its totient is φ = 11031549732.
The previous prime is 11032102313. The next prime is 11032102337. The reversal of 11032102321 is 12320123011.
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 11032102321 - 23 = 11032102313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11032102295 and 11032102304.
It is not an unprimeable number, because it can be changed into a prime (11032102351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 245181 + ... + 286666.
It is an arithmetic number, because the mean of its divisors is an integer number (2758163728).
Almost surely, 211032102321 is an apocalyptic number.
It is an amenable number.
11032102321 is a deficient number, since it is larger than the sum of its proper divisors (552591).
11032102321 is an equidigital number, since it uses as much as digits as its factorization.
11032102321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552590.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 11032102321 its reverse (12320123011), we get a palindrome (23352225332).
The spelling of 11032102321 in words is "eleven billion, thirty-two million, one hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •