Base | Representation |
---|---|
bin | 1111001001000010101… |
… | …0100001110010101111 |
3 | 220212102120021111111021 |
4 | 3302100222201302233 |
5 | 13230214011332302 |
6 | 315255543435011 |
7 | 24536066625163 |
oct | 3622052416257 |
9 | 825376244437 |
10 | 260125105327 |
11 | a035592779a |
12 | 424b7455a67 |
13 | 1b6b696cc89 |
14 | c83941cca3 |
15 | 6b76b8a437 |
hex | 3c90aa1caf |
260125105327 has 2 divisors, whose sum is σ = 260125105328. Its totient is φ = 260125105326.
The previous prime is 260125105321. The next prime is 260125105343. The reversal of 260125105327 is 723501521062.
260125105327 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 260125105327 - 23 = 260125105319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 260125105292 and 260125105301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (260125105321) 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, 130062552663 + 130062552664.
It is an arithmetic number, because the mean of its divisors is an integer number (130062552664).
Almost surely, 2260125105327 is an apocalyptic number.
260125105327 is a deficient number, since it is larger than the sum of its proper divisors (1).
260125105327 is an equidigital number, since it uses as much as digits as its factorization.
260125105327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 34.
Adding to 260125105327 its reverse (723501521062), we get a palindrome (983626626389).
The spelling of 260125105327 in words is "two hundred sixty billion, one hundred twenty-five million, one hundred five thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •