Base | Representation |
---|---|
bin | 1010010110000010011101… |
… | …1011000100110010010001 |
3 | 1111021022121010122002100001 |
4 | 2211200213123010302101 |
5 | 2442321402102334341 |
6 | 40105004401330001 |
7 | 2252503515506545 |
oct | 245404733046221 |
9 | 44238533562301 |
10 | 11373734808721 |
11 | 369563487235a |
12 | 1338380936901 |
13 | 64670038a89c |
14 | 2b46c5331a25 |
15 | 14accc2b8d31 |
hex | a58276c4c91 |
11373734808721 has 2 divisors, whose sum is σ = 11373734808722. Its totient is φ = 11373734808720.
The previous prime is 11373734808649. The next prime is 11373734808791. The reversal of 11373734808721 is 12780843737311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6859873386496 + 4513861422225 = 2619136^2 + 2124585^2 .
It is a cyclic number.
It is not a de Polignac number, because 11373734808721 - 27 = 11373734808593 is a prime.
It is a super-2 number, since 2×113737348087212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11373734808791) 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 as a sum of consecutive naturals, namely, 5686867404360 + 5686867404361.
It is an arithmetic number, because the mean of its divisors is an integer number (5686867404361).
Almost surely, 211373734808721 is an apocalyptic number.
It is an amenable number.
11373734808721 is a deficient number, since it is larger than the sum of its proper divisors (1).
11373734808721 is an equidigital number, since it uses as much as digits as its factorization.
11373734808721 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4741632, while the sum is 55.
The spelling of 11373734808721 in words is "eleven trillion, three hundred seventy-three billion, seven hundred thirty-four million, eight hundred eight thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •