Base | Representation |
---|---|
bin | 111011011110010000101010… |
… | …000010011010001101100011 |
3 | 1021022010021221202212122010021 |
4 | 323132100222002122031203 |
5 | 233240432002140213443 |
6 | 2324144535122014311 |
7 | 106044251022556006 |
oct | 7336205202321543 |
9 | 1238107852778107 |
10 | 261564213601123 |
11 | 7638483a681784 |
12 | 25404a91aa7397 |
13 | b2c452693c544 |
14 | 4883abdd1353d |
15 | 2038d436089ed |
hex | ede42a09a363 |
261564213601123 has 2 divisors, whose sum is σ = 261564213601124. Its totient is φ = 261564213601122.
The previous prime is 261564213601099. The next prime is 261564213601181. The reversal of 261564213601123 is 321106312465162.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 261564213601123 - 29 = 261564213600611 is a prime.
It is a super-2 number, since 2×2615642136011232 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 261564213601123.
It is not a weakly prime, because it can be changed into another prime (261564213301123) 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, 130782106800561 + 130782106800562.
It is an arithmetic number, because the mean of its divisors is an integer number (130782106800562).
Almost surely, 2261564213601123 is an apocalyptic number.
261564213601123 is a deficient number, since it is larger than the sum of its proper divisors (1).
261564213601123 is an equidigital number, since it uses as much as digits as its factorization.
261564213601123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 43.
The spelling of 261564213601123 in words is "two hundred sixty-one trillion, five hundred sixty-four billion, two hundred thirteen million, six hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •