Base | Representation |
---|---|
bin | 100100011010010001000001… |
… | …111000100100011101110110 |
3 | 202222222201120012120021202210 |
4 | 210122101001320210131312 |
5 | 131442121243444400114 |
6 | 1324324503333114250 |
7 | 45505230206406303 |
oct | 4432210170443566 |
9 | 688881505507683 |
10 | 160134666012534 |
11 | 47029804297714 |
12 | 15b63207788986 |
13 | 6b47832489b05 |
14 | 2b787b85b60aa |
15 | 137a70bb68259 |
hex | 91a441e24776 |
160134666012534 has 8 divisors (see below), whose sum is σ = 320269332025080. Its totient is φ = 53378222004176.
The previous prime is 160134666012533. The next prime is 160134666012539. The reversal of 160134666012534 is 435210666431061.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
160134666012534 is an admirable number.
It is a super-2 number, since 2×1601346660125342 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160134666012533) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13344555501039 + ... + 13344555501050.
It is an arithmetic number, because the mean of its divisors is an integer number (40033666503135).
Almost surely, 2160134666012534 is an apocalyptic number.
160134666012534 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
160134666012534 is a wasteful number, since it uses less digits than its factorization.
160134666012534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26689111002094.
The product of its (nonzero) digits is 1866240, while the sum is 48.
The spelling of 160134666012534 in words is "one hundred sixty trillion, one hundred thirty-four billion, six hundred sixty-six million, twelve thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •