Base | Representation |
---|---|
bin | 111101000010100001100111… |
… | …101111110101001111111101 |
3 | 1022012111222200001212210022012 |
4 | 331002201213233311033331 |
5 | 240141324030333230214 |
6 | 2350542123224301005 |
7 | 110355121464546623 |
oct | 7502414757651775 |
9 | 1265458601783265 |
10 | 268454376461309 |
11 | 785a0952a15205 |
12 | 2613830b611765 |
13 | b6a41a672053c |
14 | 4a4139283b513 |
15 | 21081ab18003e |
hex | f42867bf53fd |
268454376461309 has 2 divisors, whose sum is σ = 268454376461310. Its totient is φ = 268454376461308.
The previous prime is 268454376461267. The next prime is 268454376461317. The reversal of 268454376461309 is 903164673454862.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 267411516809284 + 1042859652025 = 16352722^2 + 1021205^2 .
It is a cyclic number.
It is not a de Polignac number, because 268454376461309 - 212 = 268454376457213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (268454376463309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 134227188230654 + 134227188230655.
It is an arithmetic number, because the mean of its divisors is an integer number (134227188230655).
It is a 1-persistent number, because it is pandigital, but 2⋅268454376461309 = 536908752922618 is not.
Almost surely, 2268454376461309 is an apocalyptic number.
It is an amenable number.
268454376461309 is a deficient number, since it is larger than the sum of its proper divisors (1).
268454376461309 is an equidigital number, since it uses as much as digits as its factorization.
268454376461309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 627056640, while the sum is 68.
The spelling of 268454376461309 in words is "two hundred sixty-eight trillion, four hundred fifty-four billion, three hundred seventy-six million, four hundred sixty-one thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •