Base | Representation |
---|---|
bin | 1011110010011100… |
… | …0100000001001001 |
3 | 22011112021222022121 |
4 | 2330213010001021 |
5 | 22440033403211 |
6 | 1241555051241 |
7 | 141262405453 |
oct | 27447040111 |
9 | 8145258277 |
10 | 3164356681 |
11 | 1384219012 |
12 | 7438a0b21 |
13 | 3b576c005 |
14 | 22038b2d3 |
15 | 137c0c271 |
hex | bc9c4049 |
3164356681 has 2 divisors, whose sum is σ = 3164356682. Its totient is φ = 3164356680.
The previous prime is 3164356669. The next prime is 3164356687. The reversal of 3164356681 is 1866534613.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2173051456 + 991305225 = 46616^2 + 31485^2 .
It is an emirp because it is prime and its reverse (1866534613) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3164356681 - 27 = 3164356553 is a prime.
It is a super-2 number, since 2×31643566812 = 20026306409178671522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3164356687) 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, 1582178340 + 1582178341.
It is an arithmetic number, because the mean of its divisors is an integer number (1582178341).
Almost surely, 23164356681 is an apocalyptic number.
It is an amenable number.
3164356681 is a deficient number, since it is larger than the sum of its proper divisors (1).
3164356681 is an equidigital number, since it uses as much as digits as its factorization.
3164356681 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 311040, while the sum is 43.
The square root of 3164356681 is about 56252.6148814435. The cubic root of 3164356681 is about 1468.1208624847.
The spelling of 3164356681 in words is "three billion, one hundred sixty-four million, three hundred fifty-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •