Base | Representation |
---|---|
bin | 1010000111110111101101… |
… | …1100110000100010000001 |
3 | 1110102001022221011210201012 |
4 | 2201331323130300202001 |
5 | 2424324404314302241 |
6 | 35401111553450305 |
7 | 2226065662620350 |
oct | 241757334604201 |
9 | 43361287153635 |
10 | 11130331400321 |
11 | 360138a9aa001 |
12 | 12b9171570995 |
13 | 62977cb6bb43 |
14 | 2a69d4a69997 |
15 | 1447d36806eb |
hex | a1f7b730881 |
11130331400321 has 4 divisors (see below), whose sum is σ = 12720378743232. Its totient is φ = 9540284057412.
The previous prime is 11130331400273. The next prime is 11130331400339. The reversal of 11130331400321 is 12300413303111.
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 a de Polignac number, because none of the positive numbers 2k-11130331400321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11130331402321) 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, 795023671445 + ... + 795023671458.
It is an arithmetic number, because the mean of its divisors is an integer number (3180094685808).
Almost surely, 211130331400321 is an apocalyptic number.
It is an amenable number.
11130331400321 is a deficient number, since it is larger than the sum of its proper divisors (1590047342911).
11130331400321 is an equidigital number, since it uses as much as digits as its factorization.
11130331400321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1590047342910.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11130331400321 its reverse (12300413303111), we get a palindrome (23430744703432).
The spelling of 11130331400321 in words is "eleven trillion, one hundred thirty billion, three hundred thirty-one million, four hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •