Base | Representation |
---|---|
bin | 11011111001100… |
… | …11111011101001 |
3 | 121022101201121022 |
4 | 31330303323221 |
5 | 434403421121 |
6 | 35120222225 |
7 | 5541231260 |
oct | 1574637351 |
9 | 538351538 |
10 | 234045161 |
11 | 110126659 |
12 | 6646a975 |
13 | 3964757c |
14 | 231255d7 |
15 | 15831aab |
hex | df33ee9 |
234045161 has 8 divisors (see below), whose sum is σ = 267608640. Its totient is φ = 200513808.
The previous prime is 234045151. The next prime is 234045193. The reversal of 234045161 is 161540432.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 234045161 - 210 = 234044137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 234045161.
It is not an unprimeable number, because it can be changed into a prime (234045121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10415 + ... + 24011.
It is an arithmetic number, because the mean of its divisors is an integer number (33451080).
Almost surely, 2234045161 is an apocalyptic number.
It is an amenable number.
234045161 is a deficient number, since it is larger than the sum of its proper divisors (33563479).
234045161 is a wasteful number, since it uses less digits than its factorization.
234045161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16063.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 234045161 is about 15298.5346030265. The cubic root of 234045161 is about 616.2636550920.
Adding to 234045161 its reverse (161540432), we get a palindrome (395585593).
The spelling of 234045161 in words is "two hundred thirty-four million, forty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •