Base | Representation |
---|---|
bin | 111100001010100010111… |
… | …0000000000100100110101 |
3 | 1002021111200120221212122011 |
4 | 1320111011300000210311 |
5 | 2040434333424223343 |
6 | 25330415031204221 |
7 | 1512262042326043 |
oct | 170250560004465 |
9 | 32244616855564 |
10 | 8268982257973 |
11 | 26a8945a04898 |
12 | b16701516671 |
13 | 47c9b954b058 |
14 | 20831412b393 |
15 | e51664b229d |
hex | 78545c00935 |
8268982257973 has 2 divisors, whose sum is σ = 8268982257974. Its totient is φ = 8268982257972.
The previous prime is 8268982257967. The next prime is 8268982258039. The reversal of 8268982257973 is 3797522898628.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4287293254084 + 3981689003889 = 2070578^2 + 1995417^2 .
It is a cyclic number.
It is not a de Polignac number, because 8268982257973 - 237 = 8131543304501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 8268982257973.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8268982257923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4134491128986 + 4134491128987.
It is an arithmetic number, because the mean of its divisors is an integer number (4134491128987).
Almost surely, 28268982257973 is an apocalyptic number.
It is an amenable number.
8268982257973 is a deficient number, since it is larger than the sum of its proper divisors (1).
8268982257973 is an equidigital number, since it uses as much as digits as its factorization.
8268982257973 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1463132160, while the sum is 76.
The spelling of 8268982257973 in words is "eight trillion, two hundred sixty-eight billion, nine hundred eighty-two million, two hundred fifty-seven thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •