Base | Representation |
---|---|
bin | 101000001110001111010… |
… | …111001000100001001101 |
3 | 100210020112201210200111002 |
4 | 220032033113020201031 |
5 | 330241303202134141 |
6 | 5513443523110045 |
7 | 403461132232226 |
oct | 50161727104115 |
9 | 10706481720432 |
10 | 2764069177421 |
11 | 976264a9a792 |
12 | 387841212325 |
13 | 17085c4c1186 |
14 | 97ad2c4824d |
15 | 4bd76b74e9b |
hex | 2838f5c884d |
2764069177421 has 2 divisors, whose sum is σ = 2764069177422. Its totient is φ = 2764069177420.
The previous prime is 2764069177417. The next prime is 2764069177439. The reversal of 2764069177421 is 1247719604672.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1934494321321 + 829574856100 = 1390861^2 + 910810^2 .
It is a cyclic number.
It is not a de Polignac number, because 2764069177421 - 22 = 2764069177417 is a prime.
It is a super-2 number, since 2×27640691774212 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2764069117421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1382034588710 + 1382034588711.
It is an arithmetic number, because the mean of its divisors is an integer number (1382034588711).
Almost surely, 22764069177421 is an apocalyptic number.
It is an amenable number.
2764069177421 is a deficient number, since it is larger than the sum of its proper divisors (1).
2764069177421 is an equidigital number, since it uses as much as digits as its factorization.
2764069177421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7112448, while the sum is 56.
The spelling of 2764069177421 in words is "two trillion, seven hundred sixty-four billion, sixty-nine million, one hundred seventy-seven thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •