Base | Representation |
---|---|
bin | 1011110010010111… |
… | …0111111101101001 |
3 | 22011111201010222211 |
4 | 2330211313331221 |
5 | 22434443421121 |
6 | 1241544245121 |
7 | 141256640314 |
oct | 27445677551 |
9 | 8144633884 |
10 | 3164045161 |
11 | 1384025a62 |
12 | 7437707a1 |
13 | 3b5690294 |
14 | 22030997b |
15 | 137b99ce1 |
hex | bc977f69 |
3164045161 has 2 divisors, whose sum is σ = 3164045162. Its totient is φ = 3164045160.
The previous prime is 3164045149. The next prime is 3164045249. The reversal of 3164045161 is 1615404613.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2554695936 + 609349225 = 50544^2 + 24685^2 .
It is an emirp because it is prime and its reverse (1615404613) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3164045161 - 27 = 3164045033 is a prime.
It is a super-2 number, since 2×31640451612 = 20022363561695031842, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3164045111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1582022580 + 1582022581.
It is an arithmetic number, because the mean of its divisors is an integer number (1582022581).
Almost surely, 23164045161 is an apocalyptic number.
It is an amenable number.
3164045161 is a deficient number, since it is larger than the sum of its proper divisors (1).
3164045161 is an equidigital number, since it uses as much as digits as its factorization.
3164045161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 31.
The square root of 3164045161 is about 56249.8458753444. The cubic root of 3164045161 is about 1468.0726837588.
Adding to 3164045161 its reverse (1615404613), we get a palindrome (4779449774).
The spelling of 3164045161 in words is "three billion, one hundred sixty-four million, forty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •