Base | Representation |
---|---|
bin | 1010101100011000100001… |
… | …0011111001100010111101 |
3 | 1112122000110020001120220012 |
4 | 2223012020103321202331 |
5 | 3020114042234010343 |
6 | 41001212250433005 |
7 | 2322313411324046 |
oct | 253061023714275 |
9 | 45560406046805 |
10 | 11757612406973 |
11 | 3823414757694 |
12 | 139a854732765 |
13 | 673979787824 |
14 | 2c91001bd8cd |
15 | 155c9858e718 |
hex | ab1884f98bd |
11757612406973 has 2 divisors, whose sum is σ = 11757612406974. Its totient is φ = 11757612406972.
The previous prime is 11757612406957. The next prime is 11757612406979. The reversal of 11757612406973 is 37960421675711.
11757612406973 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., 11392697344249 + 364915062724 = 3375307^2 + 604082^2 .
It is a cyclic number.
It is not a de Polignac number, because 11757612406973 - 24 = 11757612406957 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11757612406979) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5878806203486 + 5878806203487.
It is an arithmetic number, because the mean of its divisors is an integer number (5878806203487).
Almost surely, 211757612406973 is an apocalyptic number.
It is an amenable number.
11757612406973 is a deficient number, since it is larger than the sum of its proper divisors (1).
11757612406973 is an equidigital number, since it uses as much as digits as its factorization.
11757612406973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13335840, while the sum is 59.
The spelling of 11757612406973 in words is "eleven trillion, seven hundred fifty-seven billion, six hundred twelve million, four hundred six thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •