Base | Representation |
---|---|
bin | 1001011000001010100… |
… | …1011111011100101001 |
3 | 120101211201210202202112 |
4 | 2112002221133130221 |
5 | 10114421030022440 |
6 | 202002210212105 |
7 | 14432230616126 |
oct | 2260251373451 |
9 | 511751722675 |
10 | 161105704745 |
11 | 62362a74537 |
12 | 27281b84035 |
13 | 1226636709b |
14 | 7b246d974d |
15 | 42cda9d965 |
hex | 2582a5f729 |
161105704745 has 8 divisors (see below), whose sum is σ = 193355196360. Its totient is φ = 128865663360.
The previous prime is 161105704717. The next prime is 161105704751. The reversal of 161105704745 is 547407501161.
It is a happy number.
161105704745 is digitally balanced in base 2, 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 36204956176 + 124900748569 = 190276^2 + 353413^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 161105704745 - 28 = 161105704489 is a prime.
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, 2324996 + ... + 2393285.
It is an arithmetic number, because the mean of its divisors is an integer number (24169399545).
Almost surely, 2161105704745 is an apocalyptic number.
It is an amenable number.
161105704745 is a deficient number, since it is larger than the sum of its proper divisors (32249491615).
161105704745 is an equidigital number, since it uses as much as digits as its factorization.
161105704745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4725115.
The product of its (nonzero) digits is 117600, while the sum is 41.
The spelling of 161105704745 in words is "one hundred sixty-one billion, one hundred five million, seven hundred four thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •