Base | Representation |
---|---|
bin | 1100110000110110… |
… | …0101000001011101 |
3 | 22211202211111112112 |
4 | 3030031211001131 |
5 | 24004041032311 |
6 | 1323545243405 |
7 | 150621316334 |
oct | 31415450135 |
9 | 8752744475 |
10 | 3426111581 |
11 | 14a8a50382 |
12 | 7b7493565 |
13 | 427a68c79 |
14 | 247046d1b |
15 | 150bb428b |
hex | cc36505d |
3426111581 has 2 divisors, whose sum is σ = 3426111582. Its totient is φ = 3426111580.
The previous prime is 3426111571. The next prime is 3426111583. The reversal of 3426111581 is 1851116243.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3117547225 + 308564356 = 55835^2 + 17566^2 .
It is a cyclic number.
It is not a de Polignac number, because 3426111581 - 210 = 3426110557 is a prime.
It is a super-2 number, since 2×34261115812 = 23476481130924639122, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 3426111583, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3426111583) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1713055790 + 1713055791.
It is an arithmetic number, because the mean of its divisors is an integer number (1713055791).
Almost surely, 23426111581 is an apocalyptic number.
It is an amenable number.
3426111581 is a deficient number, since it is larger than the sum of its proper divisors (1).
3426111581 is an equidigital number, since it uses as much as digits as its factorization.
3426111581 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5760, while the sum is 32.
The square root of 3426111581 is about 58532.9956605674. The cubic root of 3426111581 is about 1507.5341801355.
The spelling of 3426111581 in words is "three billion, four hundred twenty-six million, one hundred eleven thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •