Base | Representation |
---|---|
bin | 10100011111011011… |
… | …11100111000010001 |
3 | 1001101200112220202212 |
4 | 22033231330320101 |
5 | 140012241403241 |
6 | 5015344121505 |
7 | 536421665630 |
oct | 121755747021 |
9 | 31350486685 |
10 | 11001122321 |
11 | 4735935032 |
12 | 2170306295 |
13 | 106422b447 |
14 | 7650c3517 |
15 | 445c11beb |
hex | 28fb7ce11 |
11001122321 has 4 divisors (see below), whose sum is σ = 12572711232. Its totient is φ = 9429533412.
The previous prime is 11001122299. The next prime is 11001122333. The reversal of 11001122321 is 12322110011.
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 11001122321 - 218 = 11000860177 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11001122296 and 11001122305.
It is not an unprimeable number, because it can be changed into a prime (11001122381) 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, 785794445 + ... + 785794458.
It is an arithmetic number, because the mean of its divisors is an integer number (3143177808).
Almost surely, 211001122321 is an apocalyptic number.
It is an amenable number.
11001122321 is a deficient number, since it is larger than the sum of its proper divisors (1571588911).
11001122321 is an equidigital number, since it uses as much as digits as its factorization.
11001122321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1571588910.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11001122321 its reverse (12322110011), we get a palindrome (23323232332).
The spelling of 11001122321 in words is "eleven billion, one million, one hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •