Base | Representation |
---|---|
bin | 10011101100100… |
… | …11011101100001 |
3 | 102111220120112200 |
4 | 21312103131201 |
5 | 314244333213 |
6 | 24221243413 |
7 | 4044302244 |
oct | 1166233541 |
9 | 374816480 |
10 | 165230433 |
11 | 852a5085 |
12 | 47403569 |
13 | 283023b4 |
14 | 17d3125b |
15 | e78c273 |
hex | 9d93761 |
165230433 has 12 divisors (see below), whose sum is σ = 238817748. Its totient is φ = 110083680.
The previous prime is 165230423. The next prime is 165230449. The reversal of 165230433 is 334032561.
It is a happy number.
165230433 is a `hidden beast` number, since 1 + 652 + 3 + 0 + 4 + 3 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 87385104 + 77845329 = 9348^2 + 8823^2 .
It is not a de Polignac number, because 165230433 - 213 = 165222241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 165230397 and 165230406.
It is not an unprimeable number, because it can be changed into a prime (165230423) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12003 + ... + 21783.
It is an arithmetic number, because the mean of its divisors is an integer number (19901479).
Almost surely, 2165230433 is an apocalyptic number.
It is an amenable number.
165230433 is a deficient number, since it is larger than the sum of its proper divisors (73587315).
165230433 is a wasteful number, since it uses less digits than its factorization.
165230433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11664 (or 11661 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
The square root of 165230433 is about 12854.1990415584. The cubic root of 165230433 is about 548.7358658536.
Adding to 165230433 its reverse (334032561), we get a palindrome (499262994).
The spelling of 165230433 in words is "one hundred sixty-five million, two hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •