Base | Representation |
---|---|
bin | 1011111110000110… |
… | …0110011000110001 |
3 | 22021221022022220102 |
4 | 2333201212120301 |
5 | 23040043144431 |
6 | 1250503122145 |
7 | 142425140666 |
oct | 27741463061 |
9 | 8257268812 |
10 | 3213256241 |
11 | 13a9887a78 |
12 | 758143355 |
13 | 3c2930570 |
14 | 226a79a6d |
15 | 13c16adcb |
hex | bf866631 |
3213256241 has 16 divisors (see below), whose sum is σ = 3701782224. Its totient is φ = 2762809344.
The previous prime is 3213256219. The next prime is 3213256243. The reversal of 3213256241 is 1426523123.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 77704225 + 3135552016 = 8815^2 + 55996^2 .
It is a cyclic number.
It is not a de Polignac number, because 3213256241 - 26 = 3213256177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3213256243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53510 + ... + 96383.
It is an arithmetic number, because the mean of its divisors is an integer number (231361389).
Almost surely, 23213256241 is an apocalyptic number.
It is an amenable number.
3213256241 is a deficient number, since it is larger than the sum of its proper divisors (488525983).
3213256241 is a wasteful number, since it uses less digits than its factorization.
3213256241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150020.
The product of its digits is 8640, while the sum is 29.
The square root of 3213256241 is about 56685.5911233181. The cubic root of 3213256241 is about 1475.6446464562.
Adding to 3213256241 its reverse (1426523123), we get a palindrome (4639779364).
The spelling of 3213256241 in words is "three billion, two hundred thirteen million, two hundred fifty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •