Base | Representation |
---|---|
bin | 10100100011001000… |
… | …01000100110011001 |
3 | 1001110211211220201022 |
4 | 22101210020212121 |
5 | 140043204301241 |
6 | 5022412132225 |
7 | 540246221351 |
oct | 122144104631 |
9 | 31424756638 |
10 | 11032103321 |
11 | 4751375568 |
12 | 217a767075 |
13 | 106a787ab5 |
14 | 769269b61 |
15 | 4487d154b |
hex | 291908999 |
11032103321 has 2 divisors, whose sum is σ = 11032103322. Its totient is φ = 11032103320.
The previous prime is 11032103293. The next prime is 11032103347. The reversal of 11032103321 is 12330123011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10012003600 + 1020099721 = 100060^2 + 31939^2 .
It is a cyclic number.
It is not a de Polignac number, because 11032103321 - 222 = 11027909017 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11032103321.
It is not a weakly prime, because it can be changed into another prime (11032103351) 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 as a sum of consecutive naturals, namely, 5516051660 + 5516051661.
It is an arithmetic number, because the mean of its divisors is an integer number (5516051661).
Almost surely, 211032103321 is an apocalyptic number.
It is an amenable number.
11032103321 is a deficient number, since it is larger than the sum of its proper divisors (1).
11032103321 is an equidigital number, since it uses as much as digits as its factorization.
11032103321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11032103321 its reverse (12330123011), we get a palindrome (23362226332).
The spelling of 11032103321 in words is "eleven billion, thirty-two million, one hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •