Base | Representation |
---|---|
bin | 100101100110111011… |
… | …1010111111101001001 |
3 | 21201110112022112021202 |
4 | 1023031313113331021 |
5 | 2310400343203044 |
6 | 101034020513545 |
7 | 5556250232435 |
oct | 1131567277511 |
9 | 251415275252 |
10 | 80763256649 |
11 | 312848310a9 |
12 | 1379b54b8b5 |
13 | 78012c157a |
14 | 3ca229b9c5 |
15 | 217a4d8c4e |
hex | 12cddd7f49 |
80763256649 has 2 divisors, whose sum is σ = 80763256650. Its totient is φ = 80763256648.
The previous prime is 80763256631. The next prime is 80763256667. The reversal of 80763256649 is 94665236708.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (80763256631) and next prime (80763256667).
It can be written as a sum of positive squares in only one way, i.e., 50206468624 + 30556788025 = 224068^2 + 174805^2 .
It is a cyclic number.
It is not a de Polignac number, because 80763256649 - 28 = 80763256393 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 80763256594 and 80763256603.
It is not a weakly prime, because it can be changed into another prime (80763256949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40381628324 + 40381628325.
It is an arithmetic number, because the mean of its divisors is an integer number (40381628325).
Almost surely, 280763256649 is an apocalyptic number.
It is an amenable number.
80763256649 is a deficient number, since it is larger than the sum of its proper divisors (1).
80763256649 is an equidigital number, since it uses as much as digits as its factorization.
80763256649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13063680, while the sum is 56.
The spelling of 80763256649 in words is "eighty billion, seven hundred sixty-three million, two hundred fifty-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •