Base | Representation |
---|---|
bin | 1010010010111110001010… |
… | …1000100111101011100101 |
3 | 1111002021120211011120000222 |
4 | 2210233202220213223211 |
5 | 2440440443011432234 |
6 | 40024451533014125 |
7 | 2245626644543015 |
oct | 244574250475345 |
9 | 44067524146028 |
10 | 11321041124069 |
11 | 3675254637146 |
12 | 132a115924345 |
13 | 641753535b21 |
14 | 2b1d26d73c45 |
15 | 1497461da42e |
hex | a4be2a27ae5 |
11321041124069 has 2 divisors, whose sum is σ = 11321041124070. Its totient is φ = 11321041124068.
The previous prime is 11321041124033. The next prime is 11321041124117. The reversal of 11321041124069 is 96042114012311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6455090431969 + 4865950692100 = 2540687^2 + 2205890^2 .
It is a cyclic number.
It is not a de Polignac number, because 11321041124069 - 28 = 11321041123813 is a prime.
It is a super-2 number, since 2×113210411240692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11321041124009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660520562034 + 5660520562035.
It is an arithmetic number, because the mean of its divisors is an integer number (5660520562035).
Almost surely, 211321041124069 is an apocalyptic number.
It is an amenable number.
11321041124069 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321041124069 is an equidigital number, since it uses as much as digits as its factorization.
11321041124069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 35.
The spelling of 11321041124069 in words is "eleven trillion, three hundred twenty-one billion, forty-one million, one hundred twenty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •