Base | Representation |
---|---|
bin | 11111000001001… |
… | …01101010011001 |
3 | 200010121120211021 |
4 | 33200211222121 |
5 | 1013102413423 |
6 | 41453002441 |
7 | 6306446554 |
oct | 1740455231 |
9 | 603546737 |
10 | 260201113 |
11 | 123970a47 |
12 | 73183421 |
13 | 41ba4973 |
14 | 267b369b |
15 | 17c9b95d |
hex | f825a99 |
260201113 has 2 divisors, whose sum is σ = 260201114. Its totient is φ = 260201112.
The previous prime is 260201111. The next prime is 260201153. The reversal of 260201113 is 311102062.
260201113 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 can be written as a sum of positive squares in only one way, i.e., 223562304 + 36638809 = 14952^2 + 6053^2 .
It is a cyclic number.
It is not a de Polignac number, because 260201113 - 21 = 260201111 is a prime.
It is a super-3 number, since 3×2602011133 (a number of 26 digits) contains 333 as substring.
Together with 260201111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (260201111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130100556 + 130100557.
It is an arithmetic number, because the mean of its divisors is an integer number (130100557).
Almost surely, 2260201113 is an apocalyptic number.
It is an amenable number.
260201113 is a deficient number, since it is larger than the sum of its proper divisors (1).
260201113 is an equidigital number, since it uses as much as digits as its factorization.
260201113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 260201113 is about 16130.7505405049. The cubic root of 260201113 is about 638.4149521640.
Adding to 260201113 its reverse (311102062), we get a palindrome (571303175).
The spelling of 260201113 in words is "two hundred sixty million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •