Base | Representation |
---|---|
bin | 100011100100010100… |
… | …1010101110110101001 |
3 | 21022011002210211120202 |
4 | 1013020221111312221 |
5 | 2222411431142044 |
6 | 55031104001545 |
7 | 5342533306265 |
oct | 1071051256651 |
9 | 238132724522 |
10 | 76380724649 |
11 | 2a435a22a29 |
12 | 129779002b5 |
13 | 7283366378 |
14 | 39a820d0a5 |
15 | 1ec08a0c4e |
hex | 11c8a55da9 |
76380724649 has 2 divisors, whose sum is σ = 76380724650. Its totient is φ = 76380724648.
The previous prime is 76380724619. The next prime is 76380724687. The reversal of 76380724649 is 94642708367.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 38964786025 + 37415938624 = 197395^2 + 193432^2 .
It is an emirp because it is prime and its reverse (94642708367) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 76380724649 - 232 = 72085757353 is a prime.
It is a super-4 number, since 4×763807246494 (a number of 45 digits) contains 4444 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 76380724594 and 76380724603.
It is not a weakly prime, because it can be changed into another prime (76380724619) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38190362324 + 38190362325.
It is an arithmetic number, because the mean of its divisors is an integer number (38190362325).
Almost surely, 276380724649 is an apocalyptic number.
It is an amenable number.
76380724649 is a deficient number, since it is larger than the sum of its proper divisors (1).
76380724649 is an equidigital number, since it uses as much as digits as its factorization.
76380724649 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12192768, while the sum is 56.
The spelling of 76380724649 in words is "seventy-six billion, three hundred eighty million, seven hundred twenty-four thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •