Base | Representation |
---|---|
bin | 10001100000011000011111… |
… | …111101101000111001110001 |
3 | 101002121101010012222021111012 |
4 | 101200120133331220321301 |
5 | 40042414330210000423 |
6 | 431425405221200305 |
7 | 22134332336014523 |
oct | 2140303775507161 |
9 | 332541105867435 |
10 | 76992120000113 |
11 | 225941a161796a |
12 | 8775709260095 |
13 | 33c64309161b6 |
14 | 150261d30da13 |
15 | 8d7b1d500078 |
hex | 46061ff68e71 |
76992120000113 has 2 divisors, whose sum is σ = 76992120000114. Its totient is φ = 76992120000112.
The previous prime is 76992120000097. The next prime is 76992120000121. The reversal of 76992120000113 is 31100002129967.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60009083381809 + 16983036618304 = 7746553^2 + 4121048^2 .
It is an emirp because it is prime and its reverse (31100002129967) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 76992120000113 - 24 = 76992120000097 is a prime.
It is a super-2 number, since 2×769921200001132 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (76992120008113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38496060000056 + 38496060000057.
It is an arithmetic number, because the mean of its divisors is an integer number (38496060000057).
Almost surely, 276992120000113 is an apocalyptic number.
It is an amenable number.
76992120000113 is a deficient number, since it is larger than the sum of its proper divisors (1).
76992120000113 is an equidigital number, since it uses as much as digits as its factorization.
76992120000113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40824, while the sum is 41.
The spelling of 76992120000113 in words is "seventy-six trillion, nine hundred ninety-two billion, one hundred twenty million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •