Base | Representation |
---|---|
bin | 10100000010110… |
… | …11000010111001 |
3 | 102201101122200121 |
4 | 22001123002321 |
5 | 321021120311 |
6 | 24403533241 |
7 | 4111131616 |
oct | 1201330271 |
9 | 381348617 |
10 | 168145081 |
11 | 86a05985 |
12 | 4838a221 |
13 | 28ab2c40 |
14 | 1848d50d |
15 | eb65b71 |
hex | a05b0b9 |
168145081 has 4 divisors (see below), whose sum is σ = 181079332. Its totient is φ = 155210832.
The previous prime is 168145073. The next prime is 168145121. The reversal of 168145081 is 180541861.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 180541861 = 31 ⋅5823931.
It can be written as a sum of positive squares in 2 ways, for example, as 59151481 + 108993600 = 7691^2 + 10440^2 .
It is a cyclic number.
It is not a de Polignac number, because 168145081 - 23 = 168145073 is a prime.
It is a super-2 number, since 2×1681450812 = 56545536528993122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (168145051) 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, 6467106 + ... + 6467131.
It is an arithmetic number, because the mean of its divisors is an integer number (45269833).
Almost surely, 2168145081 is an apocalyptic number.
It is an amenable number.
168145081 is a deficient number, since it is larger than the sum of its proper divisors (12934251).
168145081 is a wasteful number, since it uses less digits than its factorization.
168145081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12934250.
The product of its (nonzero) digits is 7680, while the sum is 34.
The square root of 168145081 is about 12967.0768101373. The cubic root of 168145081 is about 551.9436258766.
The spelling of 168145081 in words is "one hundred sixty-eight million, one hundred forty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •