Base | Representation |
---|---|
bin | 1001010101110110100… |
… | …1110000010010101011 |
3 | 120100020110212112220011 |
4 | 2111131221300102223 |
5 | 10112133131013442 |
6 | 201420434512351 |
7 | 14410653064126 |
oct | 2253551602253 |
9 | 510213775804 |
10 | 160485016747 |
11 | 62074676450 |
12 | 2712a1356b7 |
13 | 121978a6b93 |
14 | 7aa60c93bd |
15 | 4294346117 |
hex | 255da704ab |
160485016747 has 8 divisors (see below), whose sum is σ = 175080831552. Its totient is φ = 145890246600.
The previous prime is 160485016733. The next prime is 160485016771. The reversal of 160485016747 is 747610584061.
It is a happy number.
160485016747 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 160485016747 - 27 = 160485016619 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 160485016747.
It is not an unprimeable number, because it can be changed into a prime (160485016147) by changing a digit.
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, 79368 + ... + 572074.
It is an arithmetic number, because the mean of its divisors is an integer number (21885103944).
Almost surely, 2160485016747 is an apocalyptic number.
160485016747 is a deficient number, since it is larger than the sum of its proper divisors (14595814805).
160485016747 is a wasteful number, since it uses less digits than its factorization.
160485016747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 522329.
The product of its (nonzero) digits is 1128960, while the sum is 49.
The spelling of 160485016747 in words is "one hundred sixty billion, four hundred eighty-five million, sixteen thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •