Base | Representation |
---|---|
bin | 1011111110100111… |
… | …0111100011000001 |
3 | 22022002101110001222 |
4 | 2333221313203001 |
5 | 23041122024211 |
6 | 1251021404425 |
7 | 142452436031 |
oct | 27751674301 |
9 | 8262343058 |
10 | 3215423681 |
11 | 1400028448 |
12 | 758a09715 |
13 | 3c320bc82 |
14 | 2270818c1 |
15 | 13c4481db |
hex | bfa778c1 |
3215423681 has 2 divisors, whose sum is σ = 3215423682. Its totient is φ = 3215423680.
The previous prime is 3215423669. The next prime is 3215423683. The reversal of 3215423681 is 1863245123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2681582656 + 533841025 = 51784^2 + 23105^2 .
It is a cyclic number.
It is not a de Polignac number, because 3215423681 - 210 = 3215422657 is a prime.
It is a super-2 number, since 2×32154236812 = 20677898896671179522, which contains 22 as substring.
Together with 3215423683, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (3215423683) 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, 1607711840 + 1607711841.
It is an arithmetic number, because the mean of its divisors is an integer number (1607711841).
Almost surely, 23215423681 is an apocalyptic number.
It is an amenable number.
3215423681 is a deficient number, since it is larger than the sum of its proper divisors (1).
3215423681 is an equidigital number, since it uses as much as digits as its factorization.
3215423681 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34560, while the sum is 35.
The square root of 3215423681 is about 56704.7059863641. The cubic root of 3215423681 is about 1475.9763610918.
The spelling of 3215423681 in words is "three billion, two hundred fifteen million, four hundred twenty-three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •