Base | Representation |
---|---|
bin | 10100100000110110… |
… | …10110001001110001 |
3 | 1001102111221111111121 |
4 | 22100123112021301 |
5 | 140023313203241 |
6 | 5020451142241 |
7 | 536625100540 |
oct | 122033261161 |
9 | 31374844447 |
10 | 11013022321 |
11 | 4741622744 |
12 | 21742a4981 |
13 | 1066836a72 |
14 | 766900157 |
15 | 446cb2ad1 |
hex | 2906d6271 |
11013022321 has 4 divisors (see below), whose sum is σ = 12586311232. Its totient is φ = 9439733412.
The previous prime is 11013022313. The next prime is 11013022327. The reversal of 11013022321 is 12322031011.
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 11013022321 - 23 = 11013022313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11013022295 and 11013022304.
It is not an unprimeable number, because it can be changed into a prime (11013022327) 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, 786644445 + ... + 786644458.
It is an arithmetic number, because the mean of its divisors is an integer number (3146577808).
Almost surely, 211013022321 is an apocalyptic number.
It is an amenable number.
11013022321 is a deficient number, since it is larger than the sum of its proper divisors (1573288911).
11013022321 is an equidigital number, since it uses as much as digits as its factorization.
11013022321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1573288910.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 11013022321 its reverse (12322031011), we get a palindrome (23335053332).
The spelling of 11013022321 in words is "eleven billion, thirteen million, twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •