Base | Representation |
---|---|
bin | 1010011010001101111100… |
… | …0111101101001010000001 |
3 | 1111112011221002122110222221 |
4 | 2212203133013231022001 |
5 | 3000010424232400211 |
6 | 40202001242531041 |
7 | 2260625025423541 |
oct | 246433707551201 |
9 | 44464832573887 |
10 | 11445536215681 |
11 | 371302a89a107 |
12 | 134a27ab06a81 |
13 | 650403a987c9 |
14 | 2b7d772a9321 |
15 | 14cad0b0ec71 |
hex | a68df1ed281 |
11445536215681 has 2 divisors, whose sum is σ = 11445536215682. Its totient is φ = 11445536215680.
The previous prime is 11445536215639. The next prime is 11445536215697. The reversal of 11445536215681 is 18651263554411.
11445536215681 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11329895412081 + 115640803600 = 3365991^2 + 340060^2 .
It is a cyclic number.
It is not a de Polignac number, because 11445536215681 - 219 = 11445535691393 is a prime.
It is a super-2 number, since 2×114455362156812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11445536210681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5722768107840 + 5722768107841.
It is an arithmetic number, because the mean of its divisors is an integer number (5722768107841).
Almost surely, 211445536215681 is an apocalyptic number.
It is an amenable number.
11445536215681 is a deficient number, since it is larger than the sum of its proper divisors (1).
11445536215681 is an equidigital number, since it uses as much as digits as its factorization.
11445536215681 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3456000, while the sum is 52.
The spelling of 11445536215681 in words is "eleven trillion, four hundred forty-five billion, five hundred thirty-six million, two hundred fifteen thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •