Base | Representation |
---|---|
bin | 10100100010111001… |
… | …01001010110100001 |
3 | 1001110201011011222121 |
4 | 22101130221112201 |
5 | 140042203442241 |
6 | 5022302104241 |
7 | 540223434334 |
oct | 122134512641 |
9 | 31421134877 |
10 | 11030140321 |
11 | 4750254752 |
12 | 2179b7b081 |
13 | 106a24b465 |
14 | 768cb861b |
15 | 448544ad1 |
hex | 2917295a1 |
11030140321 has 2 divisors, whose sum is σ = 11030140322. Its totient is φ = 11030140320.
The previous prime is 11030140309. The next prime is 11030140327. The reversal of 11030140321 is 12304103011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10994571025 + 35569296 = 104855^2 + 5964^2 .
It is a cyclic number.
It is not a de Polignac number, because 11030140321 - 27 = 11030140193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11030140295 and 11030140304.
It is not a weakly prime, because it can be changed into another prime (11030140327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515070160 + 5515070161.
It is an arithmetic number, because the mean of its divisors is an integer number (5515070161).
Almost surely, 211030140321 is an apocalyptic number.
It is an amenable number.
11030140321 is a deficient number, since it is larger than the sum of its proper divisors (1).
11030140321 is an equidigital number, since it uses as much as digits as its factorization.
11030140321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 11030140321 its reverse (12304103011), we get a palindrome (23334243332).
The spelling of 11030140321 in words is "eleven billion, thirty million, one hundred forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •