Base | Representation |
---|---|
bin | 11110100010111… |
… | …10111000111101 |
3 | 122212011101212022 |
4 | 33101132320331 |
5 | 1011044204323 |
6 | 41232045525 |
7 | 6231004634 |
oct | 1721367075 |
9 | 585141768 |
10 | 256241213 |
11 | 1217068a8 |
12 | 719938a5 |
13 | 41119427 |
14 | 2606251b |
15 | 177684c8 |
hex | f45ee3d |
256241213 has 2 divisors, whose sum is σ = 256241214. Its totient is φ = 256241212.
The previous prime is 256241203. The next prime is 256241231. The reversal of 256241213 is 312142652.
It is a happy number.
Together with next prime (256241231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 155700484 + 100540729 = 12478^2 + 10027^2 .
It is a cyclic number.
It is not a de Polignac number, because 256241213 - 24 = 256241197 is a prime.
It is a super-2 number, since 2×2562412132 = 131319118479422738, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (256241203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 128120606 + 128120607.
It is an arithmetic number, because the mean of its divisors is an integer number (128120607).
Almost surely, 2256241213 is an apocalyptic number.
It is an amenable number.
256241213 is a deficient number, since it is larger than the sum of its proper divisors (1).
256241213 is an equidigital number, since it uses as much as digits as its factorization.
256241213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2880, while the sum is 26.
The square root of 256241213 is about 16007.5361314601. The cubic root of 256241213 is about 635.1597861890.
Adding to 256241213 its reverse (312142652), we get a palindrome (568383865).
The spelling of 256241213 in words is "two hundred fifty-six million, two hundred forty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •