Base | Representation |
---|---|
bin | 10100000010100… |
… | …10110100100101 |
3 | 102201022221111001 |
4 | 22001102310211 |
5 | 321014031042 |
6 | 24403113301 |
7 | 4110631456 |
oct | 1201226445 |
9 | 381287431 |
10 | 168111397 |
11 | 86992643 |
12 | 48372831 |
13 | 28aa07cc |
14 | 1848112d |
15 | eb5abb7 |
hex | a052d25 |
168111397 has 4 divisors (see below), whose sum is σ = 168226240. Its totient is φ = 167996556.
The previous prime is 168111353. The next prime is 168111401. The reversal of 168111397 is 793111861.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 168111397 - 223 = 159722789 is a prime.
It is a super-2 number, since 2×1681113972 = 56522883602583218, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (168111197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55197 + ... + 58162.
It is an arithmetic number, because the mean of its divisors is an integer number (42056560).
Almost surely, 2168111397 is an apocalyptic number.
It is an amenable number.
168111397 is a deficient number, since it is larger than the sum of its proper divisors (114843).
168111397 is a wasteful number, since it uses less digits than its factorization.
168111397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114842.
The product of its digits is 9072, while the sum is 37.
The square root of 168111397 is about 12965.7779172713. Note that the first 3 decimals coincide. The cubic root of 168111397 is about 551.9067670113.
The spelling of 168111397 in words is "one hundred sixty-eight million, one hundred eleven thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •