Base | Representation |
---|---|
bin | 10100000010110… |
… | …10001001111011 |
3 | 102201101110200120 |
4 | 22001122021323 |
5 | 321021011220 |
6 | 24403504323 |
7 | 4111115160 |
oct | 1201321173 |
9 | 381343616 |
10 | 168141435 |
11 | 86a03170 |
12 | 483880a3 |
13 | 28ab1397 |
14 | 1848c067 |
15 | eb64a40 |
hex | a05a27b |
168141435 has 32 divisors (see below), whose sum is σ = 335411712. Its totient is φ = 69876480.
The previous prime is 168141433. The next prime is 168141439. The reversal of 168141435 is 534141861.
It is not a de Polignac number, because 168141435 - 21 = 168141433 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 168141396 and 168141405.
It is not an unprimeable number, because it can be changed into a prime (168141433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 71634 + ... + 73943.
It is an arithmetic number, because the mean of its divisors is an integer number (10481616).
Almost surely, 2168141435 is an apocalyptic number.
168141435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
168141435 is a deficient number, since it is larger than the sum of its proper divisors (167270277).
168141435 is a wasteful number, since it uses less digits than its factorization.
168141435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145603.
The product of its digits is 11520, while the sum is 33.
The square root of 168141435 is about 12966.9362225624. The cubic root of 168141435 is about 551.9396364627.
The spelling of 168141435 in words is "one hundred sixty-eight million, one hundred forty-one thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •