Base | Representation |
---|---|
bin | 1010010011000010001110… |
… | …0010100001000110101111 |
3 | 1111002101101201011101102021 |
4 | 2210300203202201012233 |
5 | 2441000210242341221 |
6 | 40025151552211011 |
7 | 2245665636315463 |
oct | 244604342410657 |
9 | 44071351141367 |
10 | 11322130043311 |
11 | 36757632732aa |
12 | 132a37a539a67 |
13 | 641898007039 |
14 | 2b1dcb82a4a3 |
15 | 1497abad3041 |
hex | a4c238a11af |
11322130043311 has 4 divisors (see below), whose sum is σ = 11323447038072. Its totient is φ = 11320813048552.
The previous prime is 11322130043281. The next prime is 11322130043437. The reversal of 11322130043311 is 11334003122311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11322130043311 - 211 = 11322130041263 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11322130043011) 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, 658484485 + ... + 658501678.
It is an arithmetic number, because the mean of its divisors is an integer number (2830861759518).
Almost surely, 211322130043311 is an apocalyptic number.
11322130043311 is a deficient number, since it is larger than the sum of its proper divisors (1316994761).
11322130043311 is an equidigital number, since it uses as much as digits as its factorization.
11322130043311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1316994760.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 11322130043311 its reverse (11334003122311), we get a palindrome (22656133165622).
The spelling of 11322130043311 in words is "eleven trillion, three hundred twenty-two billion, one hundred thirty million, forty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •