Base | Representation |
---|---|
bin | 1101010101101011… |
… | …00011010011001001 |
3 | 200111001221012122202 |
4 | 12222311203103021 |
5 | 104131222212413 |
6 | 3142331525545 |
7 | 342313422353 |
oct | 65265432311 |
9 | 20431835582 |
10 | 7161132233 |
11 | 30452aa702 |
12 | 147a2b98b5 |
13 | 8a1801b68 |
14 | 4bd1020d3 |
15 | 2bda46e58 |
hex | 1aad634c9 |
7161132233 has 4 divisors (see below), whose sum is σ = 7161305088. Its totient is φ = 7160959380.
The previous prime is 7161132217. The next prime is 7161132269. The reversal of 7161132233 is 3322311617.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 7161132233 - 24 = 7161132217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 7161132196 and 7161132205.
It is not an unprimeable number, because it can be changed into a prime (7161131233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16868 + ... + 120858.
It is an arithmetic number, because the mean of its divisors is an integer number (1790326272).
Almost surely, 27161132233 is an apocalyptic number.
It is an amenable number.
7161132233 is a deficient number, since it is larger than the sum of its proper divisors (172855).
7161132233 is a wasteful number, since it uses less digits than its factorization.
7161132233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172854.
The product of its digits is 4536, while the sum is 29.
The square root of 7161132233 is about 84623.4732978977. The cubic root of 7161132233 is about 1927.4978297682.
The spelling of 7161132233 in words is "seven billion, one hundred sixty-one million, one hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •