Base | Representation |
---|---|
bin | 1001001011011… |
… | …00100011000001 |
3 | 12100212112022211 |
4 | 10211230203001 |
5 | 124202200112 |
6 | 11350102121 |
7 | 1623260362 |
oct | 445544301 |
9 | 170775284 |
10 | 76990657 |
11 | 3a506247 |
12 | 2194a941 |
13 | 12c48703 |
14 | a321b69 |
15 | 6b5c0a7 |
hex | 496c8c1 |
76990657 has 2 divisors, whose sum is σ = 76990658. Its totient is φ = 76990656.
The previous prime is 76990651. The next prime is 76990687. The reversal of 76990657 is 75609967.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74028816 + 2961841 = 8604^2 + 1721^2 .
It is an emirp because it is prime and its reverse (75609967) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 76990657 - 23 = 76990649 is a prime.
It is a super-2 number, since 2×769906572 = 11855122530583298, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 76990657.
It is not a weakly prime, because it can be changed into another prime (76990651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38495328 + 38495329.
It is an arithmetic number, because the mean of its divisors is an integer number (38495329).
Almost surely, 276990657 is an apocalyptic number.
It is an amenable number.
76990657 is a deficient number, since it is larger than the sum of its proper divisors (1).
76990657 is an equidigital number, since it uses as much as digits as its factorization.
76990657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 714420, while the sum is 49.
The square root of 76990657 is about 8774.4320044092. The cubic root of 76990657 is about 425.4148788372.
The spelling of 76990657 in words is "seventy-six million, nine hundred ninety thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •