Base | Representation |
---|---|
bin | 1011110010100010… |
… | …0101010000010001 |
3 | 22011120001012122201 |
4 | 2330220211100101 |
5 | 22440134124321 |
6 | 1242011403201 |
7 | 141265654564 |
oct | 27450452021 |
9 | 8146035581 |
10 | 3164754961 |
11 | 1384470275 |
12 | 743a53501 |
13 | 3b587b394 |
14 | 2204524db |
15 | 137c8a291 |
hex | bca25411 |
3164754961 has 2 divisors, whose sum is σ = 3164754962. Its totient is φ = 3164754960.
The previous prime is 3164754959. The next prime is 3164754973. The reversal of 3164754961 is 1694574613.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1630544400 + 1534210561 = 40380^2 + 39169^2 .
It is a cyclic number.
It is not a de Polignac number, because 3164754961 - 21 = 3164754959 is a prime.
It is a super-2 number, since 2×31647549612 = 20031347926348223042, which contains 22 as substring.
Together with 3164754959, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3164764961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1582377480 + 1582377481.
It is an arithmetic number, because the mean of its divisors is an integer number (1582377481).
Almost surely, 23164754961 is an apocalyptic number.
It is an amenable number.
3164754961 is a deficient number, since it is larger than the sum of its proper divisors (1).
3164754961 is an equidigital number, since it uses as much as digits as its factorization.
3164754961 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 544320, while the sum is 46.
The square root of 3164754961 is about 56256.1548721560. The cubic root of 3164754961 is about 1468.1824546403.
The spelling of 3164754961 in words is "three billion, one hundred sixty-four million, seven hundred fifty-four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •