Base | Representation |
---|---|
bin | 1010010010111110001010… |
… | …1111110111100010001101 |
3 | 1111002021120221202002021021 |
4 | 2210233202233313202031 |
5 | 2440440444003232023 |
6 | 40024452041434141 |
7 | 2245626666645142 |
oct | 244574257674215 |
9 | 44067527662237 |
10 | 11321043024013 |
11 | 3675255714648 |
12 | 132a11649b951 |
13 | 641753a4c858 |
14 | 2b1d2730a3c9 |
15 | 14974646335d |
hex | a4be2bf788d |
11321043024013 has 2 divisors, whose sum is σ = 11321043024014. Its totient is φ = 11321043024012.
The previous prime is 11321043024007. The next prime is 11321043024043. The reversal of 11321043024013 is 31042034012311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10471838384484 + 849204639529 = 3236022^2 + 921523^2 .
It is a cyclic number.
It is not a de Polignac number, because 11321043024013 - 29 = 11321043023501 is a prime.
It is a super-3 number, since 3×113210430240133 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11321043024043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660521512006 + 5660521512007.
It is an arithmetic number, because the mean of its divisors is an integer number (5660521512007).
Almost surely, 211321043024013 is an apocalyptic number.
It is an amenable number.
11321043024013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321043024013 is an equidigital number, since it uses as much as digits as its factorization.
11321043024013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 11321043024013 its reverse (31042034012311), we get a palindrome (42363077036324).
The spelling of 11321043024013 in words is "eleven trillion, three hundred twenty-one billion, forty-three million, twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •