Base | Representation |
---|---|
bin | 10001011001110100101010… |
… | …001101101000000000001011 |
3 | 101001000021112012222200100102 |
4 | 101121310222031220000023 |
5 | 40013023111010144221 |
6 | 430442332553200015 |
7 | 22056633162426014 |
oct | 2131645215500013 |
9 | 331007465880312 |
10 | 76541320396811 |
11 | 2242aa9aa32746 |
12 | 870227940000b |
13 | 3392a7a9939ba |
14 | 14c889655600b |
15 | 8cb036e6730b |
hex | 459d2a36800b |
76541320396811 has 2 divisors, whose sum is σ = 76541320396812. Its totient is φ = 76541320396810.
The previous prime is 76541320396789. The next prime is 76541320396831. The reversal of 76541320396811 is 11869302314567.
It is a strong prime.
It is an emirp because it is prime and its reverse (11869302314567) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-76541320396811 is a prime.
It is not a weakly prime, because it can be changed into another prime (76541320396831) 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, 38270660198405 + 38270660198406.
It is an arithmetic number, because the mean of its divisors is an integer number (38270660198406).
It is a 2-persistent number, because it is pandigital, and so is 2⋅76541320396811 = 153082640793622, but 3⋅76541320396811 = 229623961190433 is not.
Almost surely, 276541320396811 is an apocalyptic number.
76541320396811 is a deficient number, since it is larger than the sum of its proper divisors (1).
76541320396811 is an equidigital number, since it uses as much as digits as its factorization.
76541320396811 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6531840, while the sum is 56.
The spelling of 76541320396811 in words is "seventy-six trillion, five hundred forty-one billion, three hundred twenty million, three hundred ninety-six thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •