Base | Representation |
---|---|
bin | 111110010011000… |
… | …001001110001011 |
3 | 2200211200021222222 |
4 | 332103001032023 |
5 | 4120031020011 |
6 | 251413404255 |
7 | 34620552662 |
oct | 7623011613 |
9 | 2624607888 |
10 | 1045173131 |
11 | 496a78052 |
12 | 25203968b |
13 | 1386c5552 |
14 | 9cb49dd9 |
15 | 61b55ddb |
hex | 3e4c138b |
1045173131 has 2 divisors, whose sum is σ = 1045173132. Its totient is φ = 1045173130.
The previous prime is 1045173121. The next prime is 1045173161. The reversal of 1045173131 is 1313715401.
1045173131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1045173131 - 214 = 1045156747 is a prime.
It is a super-2 number, since 2×10451731312 = 2184773747528686322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1045173131.
It is not a weakly prime, because it can be changed into another prime (1045173121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 522586565 + 522586566.
It is an arithmetic number, because the mean of its divisors is an integer number (522586566).
Almost surely, 21045173131 is an apocalyptic number.
1045173131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1045173131 is an equidigital number, since it uses as much as digits as its factorization.
1045173131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 26.
The square root of 1045173131 is about 32329.1374923613. The cubic root of 1045173131 is about 1014.8364999894.
Adding to 1045173131 its reverse (1313715401), we get a palindrome (2358888532).
The spelling of 1045173131 in words is "one billion, forty-five million, one hundred seventy-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •