Base | Representation |
---|---|
bin | 10100000010000… |
… | …11001000011111 |
3 | 102201012200022222 |
4 | 22001003020133 |
5 | 321010002020 |
6 | 24401455555 |
7 | 4110243224 |
oct | 1201031037 |
9 | 381180288 |
10 | 168047135 |
11 | 86949333 |
12 | 483415bb |
13 | 28a7a499 |
14 | 1846594b |
15 | eb46b25 |
hex | a04321f |
168047135 has 8 divisors (see below), whose sum is σ = 201733296. Its totient is φ = 134386560.
The previous prime is 168047123. The next prime is 168047147. The reversal of 168047135 is 531740861.
It is an interprime number because it is at equal distance from previous prime (168047123) and next prime (168047147).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 168047135 - 24 = 168047119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 168047095 and 168047104.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 13940 + ... + 23030.
It is an arithmetic number, because the mean of its divisors is an integer number (25216662).
Almost surely, 2168047135 is an apocalyptic number.
168047135 is a deficient number, since it is larger than the sum of its proper divisors (33686161).
168047135 is an equidigital number, since it uses as much as digits as its factorization.
168047135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12793.
The product of its (nonzero) digits is 20160, while the sum is 35.
The square root of 168047135 is about 12963.2995413976. The cubic root of 168047135 is about 551.8364343759.
Adding to 168047135 its reverse (531740861), we get a palindrome (699787996).
The spelling of 168047135 in words is "one hundred sixty-eight million, forty-seven thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •