Base | Representation |
---|---|
bin | 1010010011001001001100… |
… | …0000110001011001111101 |
3 | 1111002120020001021111100022 |
4 | 2210302103000301121331 |
5 | 2441013023030322443 |
6 | 40030101321141525 |
7 | 2246063165630564 |
oct | 244622300613175 |
9 | 44076201244308 |
10 | 11324000245373 |
11 | 3676532a16842 |
12 | 132a80092a8a5 |
13 | 641b0560688a |
14 | 2b2127d78bdb |
15 | 14986ada6e68 |
hex | a4c9303167d |
11324000245373 has 2 divisors, whose sum is σ = 11324000245374. Its totient is φ = 11324000245372.
The previous prime is 11324000245367. The next prime is 11324000245379. The reversal of 11324000245373 is 37354200042311.
It is a balanced prime because it is at equal distance from previous prime (11324000245367) and next prime (11324000245379).
It can be written as a sum of positive squares in only one way, i.e., 5969529200644 + 5354471044729 = 2443262^2 + 2313973^2 .
It is a cyclic number.
It is not a de Polignac number, because 11324000245373 - 216 = 11324000179837 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11324000245379) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5662000122686 + 5662000122687.
It is an arithmetic number, because the mean of its divisors is an integer number (5662000122687).
Almost surely, 211324000245373 is an apocalyptic number.
It is an amenable number.
11324000245373 is a deficient number, since it is larger than the sum of its proper divisors (1).
11324000245373 is an equidigital number, since it uses as much as digits as its factorization.
11324000245373 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60480, while the sum is 35.
Adding to 11324000245373 its reverse (37354200042311), we get a palindrome (48678200287684).
The spelling of 11324000245373 in words is "eleven trillion, three hundred twenty-four billion, two hundred forty-five thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •