Base | Representation |
---|---|
bin | 10100001001001… |
… | …00000001000001 |
3 | 102202221110212121 |
4 | 22010210001001 |
5 | 321223441012 |
6 | 24433324241 |
7 | 4121130553 |
oct | 1204440101 |
9 | 382843777 |
10 | 168968257 |
11 | 87418397 |
12 | 48706681 |
13 | 29010823 |
14 | 186254d3 |
15 | ec79a07 |
hex | a124041 |
168968257 has 4 divisors (see below), whose sum is σ = 173089476. Its totient is φ = 164847040.
The previous prime is 168968227. The next prime is 168968269. The reversal of 168968257 is 752869861.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 752869861 = 2503 ⋅300787.
It can be written as a sum of positive squares in 2 ways, for example, as 28047616 + 140920641 = 5296^2 + 11871^2 .
It is a cyclic number.
It is not a de Polignac number, because 168968257 - 223 = 160579649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (168968207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2060548 + ... + 2060629.
It is an arithmetic number, because the mean of its divisors is an integer number (43272369).
Almost surely, 2168968257 is an apocalyptic number.
It is an amenable number.
168968257 is a deficient number, since it is larger than the sum of its proper divisors (4121219).
168968257 is an equidigital number, since it uses as much as digits as its factorization.
168968257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4121218.
The product of its digits is 1451520, while the sum is 52.
The square root of 168968257 is about 12998.7790580500. The cubic root of 168968257 is about 552.8428638357.
The spelling of 168968257 in words is "one hundred sixty-eight million, nine hundred sixty-eight thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •