Base | Representation |
---|---|
bin | 111011100010110010101101… |
… | …000010010001000000010111 |
3 | 1021100020001211020120100000212 |
4 | 323202302231002101000113 |
5 | 233311032312122232043 |
6 | 2324544002400000035 |
7 | 106105614465151616 |
oct | 7342625502210027 |
9 | 1240201736510025 |
10 | 261875649024023 |
11 | 76494925876501 |
12 | 2545530900001b |
13 | b3179c995a478 |
14 | 4894bc5aab87d |
15 | 2041ebebb6018 |
hex | ee2cad091017 |
261875649024023 has 2 divisors, whose sum is σ = 261875649024024. Its totient is φ = 261875649024022.
The previous prime is 261875649023971. The next prime is 261875649024029. The reversal of 261875649024023 is 320420946578162.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 261875649024023 - 212 = 261875649019927 is a prime.
It is a super-2 number, since 2×2618756490240232 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (261875649024029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130937824512011 + 130937824512012.
It is an arithmetic number, because the mean of its divisors is an integer number (130937824512012).
It is a 2-persistent number, because it is pandigital, and so is 2⋅261875649024023 = 523751298048046, but 3⋅261875649024023 = 785626947072069 is not.
Almost surely, 2261875649024023 is an apocalyptic number.
261875649024023 is a deficient number, since it is larger than the sum of its proper divisors (1).
261875649024023 is an equidigital number, since it uses as much as digits as its factorization.
261875649024023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34836480, while the sum is 59.
The spelling of 261875649024023 in words is "two hundred sixty-one trillion, eight hundred seventy-five billion, six hundred forty-nine million, twenty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •