Base | Representation |
---|---|
bin | 1101010101101011… |
… | …01011001101100101 |
3 | 200111001222212010012 |
4 | 12222311223031211 |
5 | 104131224232040 |
6 | 3142332340005 |
7 | 342313616015 |
oct | 65265531545 |
9 | 20431885105 |
10 | 7161164645 |
11 | 3045321a98 |
12 | 147a314605 |
13 | 8a181383b |
14 | 4bd10dc45 |
15 | 2bda51865 |
hex | 1aad6b365 |
7161164645 has 8 divisors (see below), whose sum is σ = 8598708600. Its totient is φ = 5725391040.
The previous prime is 7161164623. The next prime is 7161164671. The reversal of 7161164645 is 5464611617.
7161164645 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1664721601 + 5496443044 = 40801^2 + 74138^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 7161164645 - 230 = 6087422821 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 433670 + ... + 449879.
It is an arithmetic number, because the mean of its divisors is an integer number (1074838575).
Almost surely, 27161164645 is an apocalyptic number.
It is an amenable number.
7161164645 is a deficient number, since it is larger than the sum of its proper divisors (1437543955).
7161164645 is a wasteful number, since it uses less digits than its factorization.
7161164645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 885175.
The product of its digits is 120960, while the sum is 41.
The square root of 7161164645 is about 84623.6648048287. The cubic root of 7161164645 is about 1927.5007377797.
The spelling of 7161164645 in words is "seven billion, one hundred sixty-one million, one hundred sixty-four thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •