Base | Representation |
---|---|
bin | 1001001001000… |
… | …11001011001001 |
3 | 12100022021001212 |
4 | 10210203023021 |
5 | 124113040441 |
6 | 11335422505 |
7 | 1620566234 |
oct | 444431311 |
9 | 170267055 |
10 | 76690121 |
11 | 3a320472 |
12 | 21824a35 |
13 | 12b71991 |
14 | a28441b |
15 | 6aeceeb |
hex | 49232c9 |
76690121 has 2 divisors, whose sum is σ = 76690122. Its totient is φ = 76690120.
The previous prime is 76690109. The next prime is 76690127. The reversal of 76690121 is 12109667.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49857721 + 26832400 = 7061^2 + 5180^2 .
It is an emirp because it is prime and its reverse (12109667) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 76690121 - 26 = 76690057 is a prime.
It is equal to p4487450 and since 76690121 and 4487450 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (76690127) 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, 38345060 + 38345061.
It is an arithmetic number, because the mean of its divisors is an integer number (38345061).
Almost surely, 276690121 is an apocalyptic number.
It is an amenable number.
76690121 is a deficient number, since it is larger than the sum of its proper divisors (1).
76690121 is an equidigital number, since it uses as much as digits as its factorization.
76690121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 32.
The square root of 76690121 is about 8757.2895921055. The cubic root of 76690121 is about 424.8606158839.
Adding to 76690121 its reverse (12109667), we get a palindrome (88799788).
The spelling of 76690121 in words is "seventy-six million, six hundred ninety thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •