Base | Representation |
---|---|
bin | 111110010011000… |
… | …001001110101001 |
3 | 2200211200022001002 |
4 | 332103001032221 |
5 | 4120031020121 |
6 | 251413404345 |
7 | 34620553034 |
oct | 7623011651 |
9 | 2624608032 |
10 | 1045173161 |
11 | 496a7807a |
12 | 2520396b5 |
13 | 1386c5576 |
14 | 9cb4a01b |
15 | 61b55e0b |
hex | 3e4c13a9 |
1045173161 has 2 divisors, whose sum is σ = 1045173162. Its totient is φ = 1045173160.
The previous prime is 1045173131. The next prime is 1045173163. The reversal of 1045173161 is 1613715401.
It is a happy number.
1045173161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1044259225 + 913936 = 32315^2 + 956^2 .
It is a cyclic number.
It is not a de Polignac number, because 1045173161 - 222 = 1040978857 is a prime.
Together with 1045173163, 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 (1045173163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 522586580 + 522586581.
It is an arithmetic number, because the mean of its divisors is an integer number (522586581).
Almost surely, 21045173161 is an apocalyptic number.
It is an amenable number.
1045173161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1045173161 is an equidigital number, since it uses as much as digits as its factorization.
1045173161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 29.
The square root of 1045173161 is about 32329.1379563390. The cubic root of 1045173161 is about 1014.8365096991.
Adding to 1045173161 its reverse (1613715401), we get a palindrome (2658888562).
The spelling of 1045173161 in words is "one billion, forty-five million, one hundred seventy-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •